Sciweavers

736 search results - page 47 / 148
» Confidence-Aware Join Algorithms
Sort
View
189
Voted
ICDE
2009
IEEE
120views Database» more  ICDE 2009»
16 years 2 months ago
Weighted Proximity Best-Joins for Information Retrieval
We consider the problem of efficiently computing weighted proximity best-joins over multiple lists, with applications in information retrieval and extraction. We are given a multi-...
AnHai Doan, Haixun Wang, Hao He, Jun Yang 0001, Ri...
103
Voted
KI
2011
Springer
14 years 7 months ago
A Parallel General Game Player
We have parallelized our general game player Ary on a cluster of computers. We propose multiple parallelization algorithms. For the sake of simplicity all our algorithms have proce...
Jean Méhat, Tristan Cazenave
138
Voted
VLDB
2007
ACM
229views Database» more  VLDB 2007»
15 years 6 months ago
Sum-Max Monotonic Ranked Joins for Evaluating Top-K Twig Queries on Weighted Data Graphs
In many applications, the underlying data (the web, an XML document, or a relational database) can be seen as a graph. These graphs may be enriched with weights, associated with t...
Yan Qi 0002, K. Selçuk Candan, Maria Luisa ...
ICDE
2008
IEEE
140views Database» more  ICDE 2008»
16 years 1 months ago
Top-k Spatial Joins of Probabilistic Objects
Probabilistic data have recently become popular in applications such as scientific and geospatial databases. For images and other spatial datasets, probabilistic values can capture...
Vebjorn Ljosa, Ambuj K. Singh
138
Voted
EDBT
2004
ACM
174views Database» more  EDBT 2004»
16 years 20 days ago
Processing Data-Stream Join Aggregates Using Skimmed Sketches
There is a growing interest in on-line algorithms for analyzing and querying data streams, that examine each stream element only once and have at their disposal, only a limited amo...
Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastog...