Sciweavers

122 search results - page 21 / 25
» The approximability of the String Barcoding problem
Sort
View
SIGMOD
2011
ACM
150views Database» more  SIGMOD 2011»
12 years 10 months ago
WHAM: a high-throughput sequence alignment method
Over the last decade the cost of producing genomic sequences has dropped dramatically due to the current so called “next-gen” sequencing methods. However, these next-gen seque...
Yinan Li, Allison Terrell, Jignesh M. Patel
VLDB
2007
ACM
159views Database» more  VLDB 2007»
14 years 8 months ago
Example-driven design of efficient record matching queries
Record matching is the task of identifying records that match the same real world entity. This is a problem of great significance for a variety of business intelligence applicatio...
Surajit Chaudhuri, Bee-Chung Chen, Venkatesh Ganti...
SAC
2005
ACM
14 years 1 months ago
Performance evaluation for text processing of noisy inputs
We investigate the problem of evaluating the performance of text processing algorithms on inputs that contain errors as a result of optical character recognition. A new hierarchic...
Daniel P. Lopresti
CDC
2009
IEEE
157views Control Systems» more  CDC 2009»
13 years 12 months ago
A PDE viewpoint on basic properties of coordination algorithms with symmetries
Several recent control applications consider the coordination of subsystems through local interaction. Often the interaction has a symmetry in state space, e.g. invariance with res...
Alain Sarlette, Rodolphe Sepulchre
ITA
2007
101views Communications» more  ITA 2007»
13 years 7 months ago
Learning tree languages from text
We study the problem of learning regular tree languages from text. We show that the framework of function distinguishability as introduced by the author in Theoretical Computer Sc...
Henning Fernau