Sciweavers

215 search results - page 15 / 43
» On the Linear Number of Matching Substrings
Sort
View
MMAS
2011
Springer
12 years 10 months ago
Sweeping Preconditioner for the Helmholtz Equation: Moving Perfectly Matched Layers
This paper introduces a new sweeping preconditioner for the iterative solution of the variable coefficient Helmholtz equation in two and three dimensions. The algorithms follow th...
Björn Engquist, Lexing Ying
CAAN
2004
Springer
14 years 1 months ago
Congestion Games, Load Balancing, and Price of Anarchy
Imagine a set of self-interested clients, each of whom must choose a server from a permissible set. A server’s latency is inversely proportional to its speed, but it grows linear...
Anshul Kothari, Subhash Suri, Csaba D. Tóth...
ECCV
2002
Springer
14 years 9 months ago
Multi-view Matching for Unordered Image Sets, or "How Do I Organize My Holiday Snaps?"
There has been considerable success in automated reconstruction for image sequences where small baseline algorithms can be used to establish matches across a number of images. In c...
Frederik Schaffalitzky, Andrew Zisserman
CIKM
2008
Springer
13 years 9 months ago
TinyLex: static n-gram index pruning with perfect recall
Inverted indexes using sequences of characters (n-grams) as terms provide an error-resilient and language-independent way to query for arbitrary substrings and perform approximate...
Derrick Coetzee
FUIN
2006
98views more  FUIN 2006»
13 years 8 months ago
On-line Approximate String Matching in Natural Language
We consider approximate pattern matching in natural language text. We use the words of the text as the alphabet, instead of the characters as in traditional string matching approac...
Kimmo Fredriksson