1888 search results - page 127 / 378 » Algorithms for Querying by Spatial Structure |
159
click to vote
SODA
2008
ACM
15 years 6 months ago
2008
ACM
We describe an asymptotically optimal data-structure for dynamic point location for horizontal segments. For n line-segments, queries take O(log n) time, updates take O(log n) amo...
155
click to vote
CRV
2008
IEEE
15 years 11 months ago
2008
IEEE
Dense stereo algorithms rely on matching over a range of disparities. To speed up the search and reduce match ambiguity, processing can be embedded in the hierarchical, or coarse-...
159
click to vote
SIGIR
2010
ACM
15 years 8 months ago
2010
ACM
In this paper, we present a novel image search system, image search by concept map. This system enables users to indicate not only what semantic concepts are expected to appear bu...
154
click to vote
WADS
2009
Springer
15 years 11 months ago
2009
Springer
We present a succinct representation of a set of n points on an n × n grid using n lg n + o(n lg n) bits3 to support orthogonal range counting in O(lg n/ lg lg n) time, and range ...
146
click to vote
SIGIR
2003
ACM
15 years 10 months ago
2003
ACM
One of the major problems in question answering (QA) is that the queries are either too brief or often do not contain most relevant terms in the target corpus. In order to overcom...