Sciweavers

1664 search results - page 215 / 333
» Distance labeling in graphs
Sort
View
IPPS
1998
IEEE
15 years 9 months ago
NC Algorithms for the Single Most Vital Edge Problem with Respect to All Pairs Shortest Paths
For a weighted, undirected graph G = V;E where jVj = n and jEj = m, we examine the single most vital edge with respect to two measurements related to all-pairs shortest paths APSP....
Sven Venema, Hong Shen, Francis Suraweera
CVPR
2009
IEEE
17 years 21 days ago
Active Learning for Large Multi-class Problems
Scarcity and infeasibility of human supervision for large scale multi-class classification problems necessitates active learning. Unfortunately, existing active learning methods ...
Prateek Jain (University of Texas at Austin), Ashi...
CVPR
2008
IEEE
16 years 7 months ago
Boosted deformable model for human body alignment
This paper studies image alignment, the problem of learning a shape and appearance model from labeled data and efficiently fitting the model to a non-rigid object with large varia...
Xiaoming Liu 0002, Ting Yu, Thomas Sebastian, Pete...
STOC
2004
ACM
126views Algorithms» more  STOC 2004»
16 years 5 months ago
Bypassing the embedding: algorithms for low dimensional metrics
The doubling dimension of a metric is the smallest k such that any ball of radius 2r can be covered using 2k balls of raThis concept for abstract metrics has been proposed as a na...
Kunal Talwar
PKDD
2007
Springer
91views Data Mining» more  PKDD 2007»
15 years 11 months ago
Domain Adaptation of Conditional Probability Models Via Feature Subsetting
The goal in domain adaptation is to train a model using labeled data sampled from a domain different from the target domain on which the model will be deployed. We exploit unlabel...
Sandeepkumar Satpal, Sunita Sarawagi