Sciweavers

298 search results - page 24 / 60
» Metric graph reconstruction from noisy data
Sort
View
ICDE
2003
IEEE
133views Database» more  ICDE 2003»
14 years 9 months ago
Text Joins for Data Cleansing and Integration in an RDBMS
An organization's data records are often noisy because of transcription errors, incomplete information, lack of standard formats for textual data or combinations thereof. A f...
Luis Gravano, Panagiotis G. Ipeirotis, Nick Koudas...
NIPS
2004
13 years 9 months ago
Supervised Graph Inference
We formulate the problem of graph inference where part of the graph is known as a supervised learning problem, and propose an algorithm to solve it. The method involves the learni...
Jean-Philippe Vert, Yoshihiro Yamanishi
ADCM
2007
155views more  ADCM 2007»
13 years 7 months ago
Numerical differentiation by radial basis functions approximation
Based on radial basis functions approximation, we develop in this paper a new computational algorithm for numerical diļ¬€erentiation. Under an a priori and an a posteriori choice r...
T. Wei, Y. C. Hon
DCC
2004
IEEE
14 years 7 months ago
Discrete Universal Filtering Through Incremental Parsing
In the discrete filtering problem, a data sequence over a finite alphabet is assumed to be corrupted by a discrete memoryless channel. The goal is to reconstruct the clean sequenc...
Erik Ordentlich, Tsachy Weissman, Marcelo J. Weinb...
ICML
2006
IEEE
14 years 8 months ago
Quadratic programming relaxations for metric labeling and Markov random field MAP estimation
Quadratic program relaxations are proposed as an alternative to linear program relaxations and tree reweighted belief propagation for the metric labeling or MAP estimation problem...
Pradeep D. Ravikumar, John D. Lafferty