Sciweavers

354 search results - page 23 / 71
» Approximate String Joins
Sort
View
APLAS
2006
ACM
14 years 1 months ago
A Practical String Analyzer by the Widening Approach
The static determination of approximated values of string expressions has many potential applications. For instance, approximated string values may be used to check the validity an...
Tae-Hyoung Choi, Oukseh Lee, Hyunha Kim, Kyung-Goo...
SBBD
2007
149views Database» more  SBBD 2007»
13 years 9 months ago
Embedding Similarity Joins into Native XML Databases
Similarity joins in databases can be used for several important tasks such as data cleaning and instance-based data integration. In this paper, we explore ways how to support such ...
Leonardo Ribeiro, Theo Härder
AAIM
2006
Springer
75views Algorithms» more  AAIM 2006»
14 years 1 months ago
Subsequence Packing: Complexity, Approximation, and Application
We study the subsequence packing problem: given a string T and a collection of strings {Si}, find disjoint subsequences {Ti} of T with maximum total length such that each Ti is a ...
Minghui Jiang
COCO
2007
Springer
94views Algorithms» more  COCO 2007»
13 years 11 months ago
On Approximate Majority and Probabilistic Time
We prove new results on the circuit complexity of Approximate Majority, which is the problem of computing Majority of a given bit string whose fraction of 1's is bounded away...
Emanuele Viola
FCT
2003
Springer
14 years 28 days ago
Complexity of Approximating Closest Substring Problems
The closest substring problem, where a short string is sought that minimizes the number of mismatches between it and each of a given set of strings, is a minimization problem with ...
Patricia A. Evans, Andrew D. Smith