Sciweavers

2531 search results - page 48 / 507
» Group testing in graphs
Sort
View
TOC
2008
122views more  TOC 2008»
13 years 10 months ago
Derandomizing the Ahlswede-Winter matrix-valued Chernoff bound using pessimistic estimators, and applications
: Ahlswede and Winter [IEEE Trans. Inf. Th. 2002] introduced a Chernoff bound for matrix-valued random variables, which is a non-trivial generalization of the usual Chernoff bound ...
Avi Wigderson, David Xiao
ICCV
2011
IEEE
12 years 10 months ago
Discriminative Learning of Relaxed Hierarchy for Large-scale Visual Recognition
In the real visual world, the number of categories a classifier needs to discriminate is on the order of hundreds or thousands. For example, the SUN dataset [24] contains 899 sce...
Tianshi Gao, Daphne Koller
IUI
2011
ACM
13 years 1 months ago
Groups without tears: mining social topologies from email
As people accumulate hundreds of “friends” in social media, a flat list of connections becomes unmanageable. Interfaces agnostic to social structure hinder the nuanced sharin...
Diana MacLean, Sudheendra Hangal, Seng Keat Teh, M...
CVPR
2007
IEEE
15 years 20 days ago
Multi-class object tracking algorithm that handles fragmentation and grouping
We propose a framework for detecting and tracking multiple interacting objects, while explicitly handling the dual problems of fragmentation (an object may be broken into several ...
Biswajit Bose, Xiaogang Wang, Eric Grimson
STOC
2005
ACM
96views Algorithms» more  STOC 2005»
14 years 11 months ago
Every monotone graph property is testable
A graph property is called monotone if it is closed under taking (not necessarily induced) subgraphs (or, equivalently, if it is closed under removal of edges and vertices). Many ...
Noga Alon, Asaf Shapira