Sciweavers

2638 search results - page 55 / 528
» Extracting Approximate Patterns
Sort
View
ECAI
2006
Springer
15 years 7 months ago
Extracting MUSes
Minimally unsatisfiable subformulas (in short, MUSes) represent the smallest explanations for the inconsistency of SAT instances in terms of the number of involved clauses. Extract...
Éric Grégoire, Bertrand Mazure, C&ea...
SIGGRAPH
2010
ACM
15 years 8 months ago
RepFinder: Finding Approximately Repeated Scene Elements for Image Editing
Repeated elements are ubiquitous and abundant in both manmade and natural scenes. Editing such images while preserving the repetitions and their relations is nontrivial due to over...
Ming-Ming Cheng, Fang-Lue Zhang, Niloy J. Mitra, X...
213
Voted
SIGMOD
2008
ACM
90views Database» more  SIGMOD 2008»
16 years 4 months ago
Toward best-effort information extraction
Current approaches to develop information extraction (IE) programs have largely focused on producing precise IE results. As such, they suffer from three major limitations. First, ...
Warren Shen, Pedro DeRose, Robert McCann, AnHai Do...
COCO
2001
Springer
142views Algorithms» more  COCO 2001»
15 years 8 months ago
On the Complexity of Approximating the VC Dimension
We study the complexity of approximating the VC dimension of a collection of sets, when the sets are encoded succinctly by a small circuit. We show that this problem is • Σp 3-...
Elchanan Mossel, Christopher Umans
FUIN
2006
98views more  FUIN 2006»
15 years 4 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