Sciweavers

9719 search results - page 145 / 1944
» Answer Set Optimization
Sort
View
VLDB
2007
ACM
102views Database» more  VLDB 2007»
15 years 7 months ago
Depth Estimation for Ranking Query Optimization
A relational ranking query uses a scoring function to limit the results of a conventional query to a small number of the most relevant answers. The increasing popularity of this q...
Karl Schnaitter, Joshua Spiegel, Neoklis Polyzotis
FAW
2008
Springer
127views Algorithms» more  FAW 2008»
15 years 2 months ago
Visiting a Polygon on the Optimal Way to a Query Point
Abstract. We study a constrained version of the shortest path problem in polygonal domains, in which the path must visit a given target polygon. We provide an efficient algorithm f...
Ramtin Khosravi, Mohammad Ghodsi
FOCS
2009
IEEE
15 years 7 months ago
Distance Oracles for Sparse Graphs
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
Christian Sommer 0002, Elad Verbin, Wei Yu
ICDE
2005
IEEE
135views Database» more  ICDE 2005»
16 years 2 months ago
Finding (Recently) Frequent Items in Distributed Data Streams
We consider the problem of maintaining frequency counts for items occurring frequently in the union of multiple distributed data streams. Na?ive methods of combining approximate f...
Amit Manjhi, Vladislav Shkapenyuk, Kedar Dhamdhere...
126
Voted
INFOCOM
2008
IEEE
15 years 7 months ago
Capacity of Asynchronous Random-Access Scheduling in Wireless Networks
Abstract—We study the throughput capacity of wireless networks which employ (asynchronous) random-access scheduling as opposed to deterministic scheduling. The central question w...
Deepti Chafekar, Dave Levin, V. S. Anil Kumar, Mad...