Sciweavers

621 search results - page 80 / 125
» Efficient algorithms for minimizing tree pattern queries
Sort
View
VLDB
2007
ACM
91views Database» more  VLDB 2007»
14 years 8 months ago
On Dominating Your Neighborhood Profitably
Recent research on skyline queries has attracted much interest in the database and data mining community. Given a database, an object belongs to the skyline if it cannot be domina...
Cuiping Li, Anthony K. H. Tung, Wen Jin, Martin Es...
ICDE
2006
IEEE
150views Database» more  ICDE 2006»
14 years 9 months ago
Efficient Aggregation of Ranked Inputs
A top-k query combines different rankings of the same set of objects and returns the k objects with the highest combined score according to an aggregate function. We bring to ligh...
Nikos Mamoulis, Kit Hung Cheng, Man Lung Yiu, Davi...
ECCC
2007
180views more  ECCC 2007»
13 years 7 months ago
Adaptive Algorithms for Online Decision Problems
We study the notion of learning in an oblivious changing environment. Existing online learning algorithms which minimize regret are shown to converge to the average of all locally...
Elad Hazan, C. Seshadhri
ACSC
2006
IEEE
14 years 2 months ago
Improvements of TLAESA nearest neighbour search algorithm and extension to approximation search
Nearest neighbour (NN) searches and k nearest neighbour (k-NN) searches are widely used in pattern recognition and image retrieval. An NN (k-NN) search finds the closest object (...
Ken Tokoro, Kazuaki Yamaguchi, Sumio Masuda
ESA
2011
Springer
231views Algorithms» more  ESA 2011»
12 years 7 months ago
Distribution-Aware Compressed Full-Text Indexes
Abstract. In this paper we address the problem of building a compressed self-index that, given a distribution for the pattern queries and a bound on the space occupancy, minimizes ...
Paolo Ferragina, Jouni Sirén, Rossano Ventu...