Sciweavers

1435 search results - page 85 / 287
» Generalization Error Bounds Using Unlabeled Data
Sort
View
EMMCVPR
2011
Springer
13 years 9 months ago
Branch and Bound Strategies for Non-maximal Suppression in Object Detection
In this work, we are concerned with the detection of multiple objects in an image. We demonstrate that typically applied objectives have the structure of a random field model, but...
Matthew B. Blaschko
SSDBM
2007
IEEE
127views Database» more  SSDBM 2007»
15 years 4 months ago
A Fast Algorithm for Approximate Quantiles in High Speed Data Streams
We present a fast algorithm for computing approximate quantiles in high speed data streams with deterministic error bounds. For data streams of size N where N is unknown in advanc...
Qi Zhang, Wei Wang 0010
AAAI
2010
14 years 11 months ago
G-Optimal Design with Laplacian Regularization
In many real world applications, labeled data are usually expensive to get, while there may be a large amount of unlabeled data. To reduce the labeling cost, active learning attem...
Chun Chen, Zhengguang Chen, Jiajun Bu, Can Wang, L...
HYBRID
2009
Springer
15 years 4 months ago
Event-Triggering in Distributed Networked Systems with Data Dropouts and Delays
This paper studies distributed networked systems with data dropouts and transmission delays. We propose a decentralized eventtriggering scheme, where a subsystem broadcasts its sta...
Xiaofeng Wang, Michael D. Lemmon
ICCD
2006
IEEE
113views Hardware» more  ICCD 2006»
15 years 6 months ago
A theory of Error-Rate Testing
— We have entered an era where chip yields are decreasing with scaling. A new concept called intelligible testing has been previously proposed with the goal of reversing this tre...
Shideh Shahidi, Sandeep Gupta