921 search results - page 22 / 185 » New Data Structures for Orthogonal Range Searching |
107
click to vote
IBERAMIA
2004
Springer
15 years 9 months ago
2004
Springer
We present a new branch and bound algorithm for Max-SAT which incorporates original lazy data structures, a new variable selection heuristics and a lower bound of better quality. W...
142
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Many real-world data are maintained in relational format, with different tables storing information about entities and their links or relationships. The structure (schema) of the ...
132
click to vote
INFOCOM
2007
IEEE
15 years 10 months ago
2007
IEEE
— In this paper, we study search algorithms for using a set of autonomous and cooperative mobile sensor nodes (MSN) with limited sensing and communication ranges to search a larg...
116
click to vote
DAGSTUHL
1998
15 years 5 months ago
1998
Abstract. Many data structures are naturally segmented. Generic algorithms that ignore that feature, and that treat every data structure as a uniform range of elements, are unneces...
146
click to vote
WSDM
2009
ACM
15 years 10 months ago
2009
ACM
We introduce a new visual search interface for search engines. The interface is a user-friendly and informative graphical front-end for organizing and presenting search results in...