Sciweavers

8294 search results - page 1365 / 1659
» Presenting Data from Experiments in Algorithmics
Sort
View
CORR
2011
Springer
235views Education» more  CORR 2011»
14 years 11 months ago
On the accuracy of language trees
Historical linguistics aims at inferring the most likely language phylogenetic tree starting from information concerning the evolutionary relatedness of languages. The available i...
Simone Pompei, Vittorio Loreto, Francesca Tria
WWW
2005
ACM
16 years 5 months ago
Sampling search-engine results
We consider the problem of efficiently sampling Web search engine query results. In turn, using a small random sample instead of the full set of results leads to efficient approxi...
Aris Anagnostopoulos, Andrei Z. Broder, David Carm...
139
Voted
KDD
2000
ACM
115views Data Mining» more  KDD 2000»
15 years 8 months ago
A framework for specifying explicit bias for revision of approximate information extraction rules
Information extraction is one of the most important techniques used in Text Mining. One of the main problems in building information extraction (IE) systems is that the knowledge ...
Ronen Feldman, Yair Liberzon, Binyamin Rosenfeld, ...
155
Voted
DEXA
2008
Springer
132views Database» more  DEXA 2008»
15 years 6 months ago
Efficient Updates for Continuous Skyline Computations
We address the problem of maintaining continuous skyline queries efficiently over dynamic objects with d dimensions. Skyline queries are an important new search capability for mult...
Yu-Ling Hsueh, Roger Zimmermann, Wei-Shinn Ku
270
Voted
ICDE
2006
IEEE
156views Database» more  ICDE 2006»
16 years 5 months ago
Reasoning About Approximate Match Query Results
Join techniques deploying approximate match predicates are fundamental data cleaning operations. A variety of predicates have been utilized to quantify approximate match in such o...
Sudipto Guha, Nick Koudas, Divesh Srivastava, Xiao...
« Prev « First page 1365 / 1659 Last » Next »