1888 search results - page 162 / 378 » Algorithms for Querying by Spatial Structure |
136
click to vote
EDBT
2006
ACM
16 years 4 months ago
2006
ACM
Given a set of N multi-dimensional points, we study the computation of -quantiles according to a ranking function F, which is provided by the user at runtime. Specifically, F compu...
139
click to vote
IPSN
2009
Springer
15 years 11 months ago
2009
Springer
In this work we present new in-network techniques for communication efficient approximate query processing in wireless sensornets. We use a model-based approach that constructs a...
180
click to vote
ALENEX
2008
15 years 5 months ago
2008
We present the algorithmic core of a full text data base that allows fast Boolean queries, phrase queries, and document reporting using less space than the input text. The system ...
180
click to vote
ISAAC
2010
Springer
15 years 2 months ago
2010
Springer
Shortest path query is a problem to answer the shortest path from the origin to the destination in short time. The network is fixed, and the goal of the study is to develop efficie...
149
click to vote
ICDE
2008
IEEE
15 years 11 months ago
2008
IEEE
— Skyline queries are capable of retrieving interesting points from a large data set according to multiple criteria. Most work on skyline queries so far has assumed a centralized...