Sciweavers

10608 search results - page 1957 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
STOC
2010
ACM
224views Algorithms» more  STOC 2010»
14 years 2 months ago
Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
Holger Dell and Dieter van Melkebeek
SIGGRAPH
1993
ACM
14 years 2 months ago
Interval methods for multi-point collisions between time-dependent curved surfaces
We present an efficient and robust algorithm for finding points of collision between time-dependent parametric and implicit surfaces. The algorithm detects simultaneous collisio...
John M. Snyder, Adam R. Woodbury, Kurt W. Fleische...
EDBT
1990
ACM
108views Database» more  EDBT 1990»
14 years 2 months ago
Deductive Databases - Theory Meets Practice
Deductive Databases are coming of age with the emergence of efficient and easy to use systems that support queries, reasoning, and application development on databases through dec...
Carlo Zaniolo
ACMACE
2007
ACM
14 years 2 months ago
Pinocchio: conducting a virtual symphony orchestra
We present a system that allows users of any skill to conduct a virtual orchestra. Tempo and volume of the orchestra's performance are influenced with a baton. Pinocchio work...
Bernd Bruegge, Christoph Teschner, Peter Lachenmai...
APLAS
2007
ACM
14 years 2 months ago
Scalable Simulation of Cellular Signaling Networks
Abstract. Given the combinatorial nature of cellular signalling pathways, where biological agents can bind and modify each other in a large number of ways, concurrent or agent-base...
Vincent Danos, Jérôme Feret, Walter F...
« Prev « First page 1957 / 2122 Last » Next »