Skip to main content

and
Your search also matched 32 preview-only Content is preview-only when you or your institution have not yet subscribed to it.

By making our abstracts and previews universally accessible we help you purchase only the content that is relevant to you.
results, e.g.

An Anomaly Detection Approach for Plankton Species Discovery

Include preview-only content
  1. Article

    Open Access

    Combining data and theory for derivable scientific discovery with AI-Descartes

    Scientists aim to discover meaningful formulae that accurately describe experimental data. Mathematical models of natural phenomena can be manually created from domain knowledge and fitted to data, or, in cont...

    Cristina Cornelio, Sanjeeb Dash, Vernon Austel, Tyler R. Josephson in Nature Communications (2023)

  2. Chapter and Conference Paper

    Efficient Coalition Detection in Traitor Tracing

    In this paper we study the traitor tracing problem for re-broadcasting attack. In this attack, instead of building a pirate clone device (or program) based on their secret keys and sell the clone, the attacker...

    Hongxia **, Jeffery Lotspiech in Proceedings of The Ifip Tc 11 23rd Interna… (2008)

  3. Article

    On the ball spanned by balls

    The procedure for linear programming in linear time in fixed dimension is extended to solve in linear time certain nonlinear problems. Examples are the problem of finding the smallest ball enclosingn given balls,...

    Nimrod Megiddo in Discrete & Computational Geometry (1989)

  4. Article

    On the complexity of polyhedral separability

    It is NP-complete to recognize whether two sets of points in general space can be separated by two hyperplanes. It is NP-complete to recognize whether two sets of points in the plane can be separated withk lines....

    Nimrod Megiddo in Discrete & Computational Geometry (1988)

  5. Article

    Computing circular separability

    Two sets of planar pointsS 1 andS 2 are circularly separable if there is a circle that enclosesS 1 but excludesS 2. We show that deciding whether two sets are circularly separable can be accomplished inO(n) time ...

    Joseph O'Rourke, S. Rao Kosaraju, Nimrod Megiddo in Discrete & Computational Geometry (1986)