Sciweavers

301 search results - page 27 / 61
» Efficient Sketches for the Set Query Problem
Sort
View
FAW
2009
Springer
118views Algorithms» more  FAW 2009»
15 years 2 months ago
Space-Query-Time Tradeoff for Computing the Visibility Polygon
Abstract. Computing the visibility polygon, VP, of a point in a polygonal scene, is a classical problem that has been studied extensively. In this paper, we consider the problem of...
Mostafa Nouri, Mohammad Ghodsi
ICDE
2006
IEEE
138views Database» more  ICDE 2006»
16 years 11 days ago
SUBSKY: Efficient Computation of Skylines in Subspaces
Given a set of multi-dimensional points, the skyline contains the best points according to any preference function that is monotone on all axes. In practice, applications that req...
Yufei Tao, Xiaokui Xiao, Jian Pei
SSDBM
2010
IEEE
142views Database» more  SSDBM 2010»
14 years 9 months ago
Efficient and Adaptive Distributed Skyline Computation
Skyline queries have attracted considerable attention over the last few years, mainly due to their ability to return interesting objects without the need for user-defined scoring f...
George Valkanas, Apostolos N. Papadopoulos
73
Voted
WWW
2009
ACM
15 years 11 months ago
Detecting the origin of text segments efficiently
In the origin detection problem an algorithm is given a set S of documents, ordered by creation time, and a query document D. It needs to output for every consecutive sequence of ...
Ossama Abdel Hamid, Behshad Behzadi, Stefan Christ...
ICDE
2008
IEEE
204views Database» more  ICDE 2008»
16 years 11 days ago
Keyword Search on Spatial Databases
Many applications require finding objects closest to a specified location that contains a set of keywords. For example, online yellow pages allow users to specify an address and a ...
Ian De Felipe, Vagelis Hristidis, Naphtali Rishe