Sciweavers

1435 search results - page 157 / 287
» Generalization Error Bounds Using Unlabeled Data
Sort
View
178
Voted
ICDE
2007
IEEE
162views Database» more  ICDE 2007»
15 years 11 months ago
On Density Based Transforms for Uncertain Data Mining
In spite of the great progress in the data mining field in recent years, the problem of missing and uncertain data has remained a great challenge for data mining algorithms. Many ...
Charu C. Aggarwal
CORR
2010
Springer
114views Education» more  CORR 2010»
14 years 10 months ago
Sequential Compressed Sensing
Compressed sensing allows perfect recovery of sparse signals (or signals sparse in some basis) using only a small number of random measurements. Existing results in compressed sens...
Dmitry M. Malioutov, Sujay Sanghavi, Alan S. Wills...
WWW
2003
ACM
15 years 10 months ago
Text joins in an RDBMS for web data integration
The integration of data produced and collected across autonomous, heterogeneous web services is an increasingly important and challenging problem. Due to the lack of global identi...
Luis Gravano, Panagiotis G. Ipeirotis, Nick Koudas...
SAFECOMP
1998
Springer
15 years 2 months ago
An Agenda for Specifying Software Components with Complex Data Models
Abstract. We present a method to specify software for a special kind of safetycritical embedded systems, where sensors deliver low-level values that must be abstracted and pre-proc...
Kirsten Winter, Thomas Santen, Maritta Heisel
PVLDB
2008
111views more  PVLDB 2008»
14 years 9 months ago
Approximate lineage for probabilistic databases
In probabilistic databases, lineage is fundamental to both query processing and understanding the data. Current systems s.a. Trio or Mystiq use a complete approach in which the li...
Christopher Ré, Dan Suciu