Sciweavers

178 search results - page 26 / 36
» Fast Algorithms for Top-k Approximate String Matching
Sort
View
LREC
2010
157views Education» more  LREC 2010»
14 years 11 months ago
Indexing Methods for Faster and More Effective Person Name Search
This paper compares several indexing methods for person names extracted from text, developed for an information retrieval system with requirements for fast approximate matching of...
Mark Arehart
CASCON
1997
85views Education» more  CASCON 1997»
14 years 10 months ago
Fast detection of communication patterns in distributed executions
Understanding distributed applications is a tedious and di cult task. Visualizations based on process-time diagrams are often used to obtain a better understanding of the executio...
Thomas Kunz, Michiel F. H. Seuren
WABI
2009
Springer
132views Bioinformatics» more  WABI 2009»
15 years 4 months ago
mpscan: Fast Localisation of Multiple Reads in Genomes
Abstract. With Next Generation Sequencers, sequence based transcriptomic or epigenomic assays yield millions of short sequence reads that need to be mapped back on a reference geno...
Eric Rivals, Leena Salmela, Petteri Kiiskinen, Pet...
ICMCS
2006
IEEE
113views Multimedia» more  ICMCS 2006»
15 years 3 months ago
Fast Multi-Reference Frame Motion Estimation via Downhill Simplex Search
Multi-reference frame motion estimation improves the accuracy of motion compensation in video compression, but it also dramatically increases computational complexity. Based on tr...
Chen-Kuo Chiang, Shang-Hong Lai
CORR
2010
Springer
182views Education» more  CORR 2010»
14 years 9 months ago
Fast Convergence of Natural Bargaining Dynamics in Exchange Networks
Bargaining networks model the behavior of a set of players who need to reach pairwise agreements for making profits. Nash bargaining solutions in this context correspond to soluti...
Yashodhan Kanoria, Mohsen Bayati, Christian Borgs,...