Sciweavers

237 search results - page 12 / 48
» Practical and Optimal String Matching
Sort
View
ACCV
2006
Springer
14 years 4 months ago
Statistical Shape Models Using Elastic-String Representations
Abstract. To develop statistical models for shapes, we utilize an elastic string representation where curves (denoting shapes) can bend and locally stretch (or compress) to optimal...
Anuj Srivastava, Aastha Jain, Shantanu H. Joshi, D...
VLDB
2004
ACM
120views Database» more  VLDB 2004»
14 years 4 months ago
Merging the Results of Approximate Match Operations
Data Cleaning is an important process that has been at the center of research interest in recent years. An important end goal of effective data cleaning is to identify the relatio...
Sudipto Guha, Nick Koudas, Amit Marathe, Divesh Sr...
STACS
2009
Springer
14 years 5 months ago
A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic-programming s...
Danny Hermelin, Gad M. Landau, Shir Landau, Oren W...
MST
2006
96views more  MST 2006»
13 years 10 months ago
Juggling with Pattern Matching
In the late eighties, it was shown that juggling patterns can be described by strings of numbers with fascinating combinatorial properties that have since then been studied by man...
Jean Cardinal, Steve Kremer, Stefan Langerman
SC
2000
ACM
14 years 3 months ago
Scalable Algorithms for Adaptive Statistical Designs
We present a scalable, high-performance solution to multidimensional recurrences that arise in adaptive statistical designs. Adaptive designs are an important class of learning al...
Robert H. Oehmke, Janis Hardwick, Quentin F. Stout