256 search results - page 46 / 52 » A New Synchronous Lower Bound for Set Agreement |
116
click to vote
SIGMOD
2010
ACM
14 years 12 months ago
2010
ACM
Trajectory search has long been an attractive and challenging topic which blooms various interesting applications in spatial-temporal databases. In this work, we study a new probl...
FOCS
2007
IEEE
15 years 3 months ago
2007
IEEE
We develop a new technique of proving lower bounds for the randomized communication complexity of boolean functions in the multiparty `Number on the Forehead' model. Our meth...
120
click to vote
SIGMOD
2001
ACM
15 years 12 months ago
2001
ACM
Similarity search in large time series databases has attracted much research interest recently. It is a difficult problem because of the typically high dimensionality of the data....
101
click to vote
CP
2007
Springer
15 years 6 months ago
2007
Springer
Searching for optimal solutions to a problem using lower bounds obtained from a relaxation is a common idea in Heuristic Search and Planning. In SAT and CSPs, however, explicit rel...
102
click to vote
COMPGEOM
2004
ACM
15 years 5 months ago
2004
ACM
A geometric graph is a simple graph G = (V, E) with an embedding of the set V in the plane such that the points that represent V are in general position. A geometric graph is said...