Sciweavers

246 search results - page 1 / 50
» Efficient Algorithms for Inverting Evolution
Sort
View
STOC
1996
ACM
101views Algorithms» more  STOC 1996»
13 years 9 months ago
Efficient Algorithms for Inverting Evolution
Martin Farach, Sampath Kannan
SIGIR
1999
ACM
13 years 9 months ago
Efficient Distributed Algorithms to Build Inverted Files
We present three distributed algorithms to build global inverted files for very large text collections. The distributed environment we use is a high bandwidth network of workstati...
Berthier A. Ribeiro-Neto, Edleno Silva de Moura, M...
ICDE
2005
IEEE
133views Database» more  ICDE 2005»
14 years 6 months ago
Efficient Inverted Lists and Query Algorithms for Structured Value Ranking in Update-Intensive Relational Databases
We propose a new ranking paradigm for relational databases called Structured Value Ranking (SVR). SVR uses structured data values to score (rank) the results of keyword search que...
Lin Guo, Jayavel Shanmugasundaram, Kevin S. Beyer,...
WWW
2007
ACM
14 years 5 months ago
Efficient Update of Indexes for Dynamically Changing Web Documents
Recent work on incremental crawling has enabled the indexed document collection of a search engine to be more synchronized with the changing World Wide Web. However, this synchron...
Lipyeow Lim, Min Wang, Sriram Padmanabhan, Jeffrey...
RECOMB
2006
Springer
14 years 5 months ago
Sorting by Weighted Reversals, Transpositions, and Inverted Transpositions
Abstract. During evolution, genomes are subject to genome rearrangements that alter the ordering and orientation of genes on the chromosomes. If a genome consists of a single chrom...
Martin Bader, Enno Ohlebusch