Sciweavers

1435 search results - page 51 / 287
» Generalization Error Bounds Using Unlabeled Data
Sort
View
PODS
2007
ACM
108views Database» more  PODS 2007»
15 years 10 months ago
Machine models and lower bounds for query processing
This paper gives an overview of recent work on machine models for processing massive amounts of data. The main focus is on generalizations of the classical data stream model where...
Nicole Schweikardt
TIT
2010
111views Education» more  TIT 2010»
14 years 4 months ago
Directly lower bounding the information capacity for channels with I.I.D.deletions and duplications
We directly lower bound the information capacity for channels with i.i.d. deletions and duplications. Our approach differs from previous work in that we focus on the information ca...
Adam Kirsch, Eleni Drinea
TIP
2010
155views more  TIP 2010»
14 years 8 months ago
Laplacian Regularized D-Optimal Design for Active Learning and Its Application to Image Retrieval
—In increasingly many cases of interest in computer vision and pattern recognition, one is often confronted with the situation where data size is very large. Usually, the labels ...
Xiaofei He
SIGMOD
2002
ACM
134views Database» more  SIGMOD 2002»
15 years 10 months ago
Wavelet synopses with error guarantees
Recent work has demonstrated the effectiveness of the wavelet decomposition in reducing large amounts of data to compact sets of wavelet coefficients (termed "wavelet synopse...
Minos N. Garofalakis, Phillip B. Gibbons
IJDE
2002
67views more  IJDE 2002»
14 years 9 months ago
Error, Uncertainty and Loss in Digital Evidence
Despite the potentially grave ramifications of relying on faulty information in the investigative or probabitive stages, the uncertainty in digital evidence is not being evaluated...
Eoghan Casey