3341 search results - page 187 / 669 » On Bounded Queries and Approximation |
151
click to vote
JDA
2008
15 years 4 months ago
2008
Abstract. Genome rearrangement algorithms are powerful tools to analyze gene orders in molecular evolution. Analysis of genomes evolving by reversals and transpositions leads to a ...
151
click to vote
WINET
2010
15 years 3 months ago
2010
In this paper we consider how to collect data from sensors deployed in the Euclidean plane in a timeefficient way. We assume that all sensors could adjust their transmission range...
184
click to vote
WAIM
2009
Springer
15 years 11 months ago
2009
Springer
Large amount of uncertain data is inherent in many novel and important applications such as sensor data analysis and mobile data management. A probabilistic threshold range aggrega...
113
click to vote
COCOON
2007
Springer
15 years 11 months ago
2007
Springer
We investigate the problem of finding an unknown cut through querying vertices of a graph G. Our complexity measure is the number of submitted queries. To avoid some worst cases, ...
147
click to vote
PODS
2010
ACM
15 years 6 months ago
2010
ACM
We study highly expressive query languages such as datalog, fixpoint, and while-languages on probabilistic databases. We generalize these languages such that computation steps (e....