Sciweavers

6274 search results - page 11 / 1255
» From query complexity to computational complexity
Sort
View
COMPGEOM
2005
ACM
13 years 11 months ago
The Visibility-Voronoi Complex and Its Applications
We introduce a new type of diagram called the VV(c)-diagram (the visibility–Voronoi diagram for clearance c), which is a hybrid between the visibility graph and the Voronoi diag...
Ron Wein, Jur P. van den Berg, Dan Halperin
SAT
2004
Springer
101views Hardware» more  SAT 2004»
14 years 3 months ago
An Algebraic Approach to the Complexity of Generalized Conjunctive Queries
Kolaitis and Vardi pointed out that constraint satisfaction and conjunctive query containment are essentially the same problem. We study the Boolean conjunctive queries under a mor...
Michael Bauland, Philippe Chapdelaine, Nadia Creig...
CCCG
2007
13 years 11 months ago
Fast Computation of Smallest Enclosing Circle with Center on a Query Line Segment
Here we propose an efficient algorithm for computing the smallest enclosing circle whose center is constrained to lie on a query line segment. Our algorithm preprocesses a given s...
Arindam Karmakar, Sasanka Roy, Sandip Das
DEBS
2009
ACM
14 years 4 months ago
Distributed complex event processing with query rewriting
The nature of data in enterprises and on the Internet is changing. Data used to be stored in a database first and queried later. Today timely processing of new data, represented ...
Nicholas Poul Schultz-Møller, Matteo Miglia...