Sciweavers

27 search results - page 5 / 6
» Probabilistic string similarity joins
Sort
View
NAACL
2007
15 years 5 months ago
Unsupervised Resolution of Objects and Relations on the Web
The task of identifying synonymous relations and objects, or Synonym Resolution (SR), is critical for high-quality information extraction. The bulk of previous SR work assumed str...
Alexander Yates, Oren Etzioni
APPROX
2005
Springer
96views Algorithms» more  APPROX 2005»
15 years 9 months ago
Tolerant Locally Testable Codes
An error-correcting code is said to be locally testable if it has an efficient spot-checking procedure that can distinguish codewords from strings that are far from every codeword...
Venkatesan Guruswami, Atri Rudra
IBPRIA
2011
Springer
14 years 7 months ago
Classifying Melodies Using Tree Grammars
Abstract. Similarity computation is a difficult issue in music information retrieval, because it tries to emulate the special ability that humans show for pattern recognition in ge...
José Francisco Bernabeu, Jorge Calera-Rubio...
SIGMOD
2007
ACM
192views Database» more  SIGMOD 2007»
16 years 4 months ago
Benchmarking declarative approximate selection predicates
Declarative data quality has been an active research topic. The fundamental principle behind a declarative approach to data quality is the use of declarative statements to realize...
Amit Chandel, Oktie Hassanzadeh, Nick Koudas, Moha...
BMCBI
2007
182views more  BMCBI 2007»
15 years 4 months ago
EDISA: extracting biclusters from multiple time-series of gene expression profiles
Background: Cells dynamically adapt their gene expression patterns in response to various stimuli. This response is orchestrated into a number of gene expression modules consistin...
Jochen Supper, Martin Strauch, Dierk Wanke, Klaus ...