1888 search results - page 187 / 378 » Algorithms for Querying by Spatial Structure |
140
click to vote
SWAT
2000
Springer
15 years 7 months ago
2000
Springer
We consider dictionaries over the universe U = {0, 1}w on a unit-cost RAM with word size w and a standard instruction set. We present a linear space deterministic dictionary with m...
123
click to vote
STOC
2001
ACM
16 years 4 months ago
2001
ACM
Let G = (V, E) be an undirected weighted graph with |V | = n and |E| = m. Let k 1 be an integer. We show that G = (V, E) can be preprocessed in O(kmn1/k ) expected time, construc...
108
click to vote
CDC
2008
IEEE
15 years 10 months ago
2008
IEEE
— We consider the problem of designing controllers for spatially-varying interconnected systems distributed in one spatial dimension. The matrix structure of such systems can be ...
130
click to vote
ISVD
2007
IEEE
15 years 10 months ago
2007
IEEE
Many algorithms exist for computing the 3D Voronoi diagram, but in most cases they assume that the input is in general position. Because of the many degeneracies that arise in 3D ...
149
click to vote
CIKM
2009
Springer
15 years 7 months ago
2009
Springer
Supporting semantic queries in relational databases is essential to many advanced applications. Recently, with the increasing use of ontology in various applications, the need for...