Sciweavers

2520 search results - page 247 / 504
» The complexity of approximating entropy
Sort
View
SIGMOD
2011
ACM
205views Database» more  SIGMOD 2011»
14 years 9 months ago
Interaction between record matching and data repairing
Central to a data cleaning system are record matching and data repairing. Matching aims to identify tuples that refer to the same real-world object, and repairing is to make a dat...
Wenfei Fan, Jianzhong Li, Shuai Ma, Nan Tang, Weny...
SISAP
2009
IEEE
134views Data Mining» more  SISAP 2009»
16 years 1 months ago
Searching by Similarity and Classifying Images on a Very Large Scale
—In the demonstration we will show a system for searching by similarity and automatically classifying images in a very large dataset. The demonstrated techniques are based on the...
Giuseppe Amato, Pasquale Savino
GLOBECOM
2007
IEEE
16 years 28 days ago
Initialization Techniques for Improved Convergence of LMS DFEs in Strong Interference Environments
— The least-mean square (LMS) decision-feedback equalizer (DFE) was previously shown [1], [2] to possess an extended convergence time in an interference limited environment. In [...
Arun Batra, James R. Zeidler, Aloysius A. Beex
AAAI
1994
15 years 8 months ago
Incremental Recompilation of Knowledge
d Abstract) Goran Gogic l, Christos H. Papadimitriou', and Martha Sideri2 : Approximating a general formula from above and below by Horn formulas (its Horn envelope and Horn c...
Goran Gogic, Christos H. Papadimitriou, Martha Sid...
MST
2006
149views more  MST 2006»
15 years 6 months ago
Parameterized Intractability of Distinguishing Substring Selection
A central question in computational biology is the design of genetic markers to distinguish between two given sets of (DNA) sequences. This question is formalized as the NP-comple...
Jens Gramm, Jiong Guo, Rolf Niedermeier