Sciweavers

1435 search results - page 43 / 287
» Generalization Error Bounds Using Unlabeled Data
Sort
View
PLDI
2011
ACM
12 years 11 months ago
EnerJ: approximate data types for safe and general low-power computation
Energy is increasingly a first-order concern in computer systems. Exploiting energy-accuracy trade-offs is an attractive choice in applications that can tolerate inaccuracies. Re...
Adrian Sampson, Werner Dietl, Emily Fortuna, Danus...
CVPR
2009
IEEE
15 years 3 months ago
What's It Going to Cost You?: Predicting Effort vs. Informativeness for Multi-Label Image Annotations
Active learning strategies can be useful when manual labeling effort is scarce, as they select the most informative examples to be annotated first. However, for visual category ...
Sudheendra Vijayanarasimhan (University of Texas a...
CPM
2007
Springer
102views Combinatorics» more  CPM 2007»
14 years 2 months ago
Improved Sketching of Hamming Distance with Error Correcting
We address the problem of sketching the hamming distance of data streams. We present a new notion of sketching technique, Fixable sketches and we show that using such sketch not o...
Ely Porat, Ohad Lipsky
CORR
2006
Springer
120views Education» more  CORR 2006»
13 years 8 months ago
Improved Bounds and Schemes for the Declustering Problem
Abstract. The declustering problem is to allocate given data on parallel working storage devices in such a manner that typical requests find their data evenly distributed among the...
Benjamin Doerr, Nils Hebbinghaus, Sören Werth
JMLR
2002
89views more  JMLR 2002»
13 years 8 months ago
The Set Covering Machine
We extend the classical algorithms of Valiant and Haussler for learning compact conjunctions and disjunctions of Boolean attributes to allow features that are constructed from the...
Mario Marchand, John Shawe-Taylor