2503 search results - page 351 / 501 » A study of 3-arc graphs |
175
click to vote
APPROX
2011
Springer
14 years 5 months ago
2011
Springer
Abstract. We study the space complexity of randomized streaming algorithms that provide one-sided approximation guarantees; e.g., the algorithm always returns an overestimate of th...
167
click to vote
CVPR
2004
IEEE
16 years 7 months ago
2004
IEEE
Recognition difficulty is statistically linked to ??? subject covariate factors such as age and gender for three face recognition algorithms: principle components analysis, an int...
168
click to vote
CVPR
2008
IEEE
16 years 7 months ago
2008
IEEE
We present a random field based model for stereo vision with explicit occlusion labeling in a probabilistic framework. The model employs non-parametric cost functions that can be ...
162
click to vote
CVPR
2008
IEEE
16 years 7 months ago
2008
IEEE
This paper presents a novel distributed framework for multi-target tracking with an efficient data association computation. A decentralized representation of trackers' motion...
171
click to vote
VIS
2005
IEEE
16 years 7 months ago
2005
IEEE
We study the problem of visualizing large networks and develop es for effectively abstracting a network and reducing the size to a level that can be clearly viewed. Our size reduc...