Sciweavers

1243 search results - page 39 / 249
» On the locality of bounded growth
Sort
View
CVPR
2010
IEEE
14 years 4 months ago
Visual Recognition and Detection Under Bounded Computational Resources
Visual recognition and detection are computationally intensive tasks and current research efforts primarily focus on solving them without considering the computational capability ...
Sudheendra Vijayanarasimhan, Ashish Kapoor
WEBI
2007
Springer
14 years 1 months ago
Experimental Bounds on the Usefulness of Personalized and Topic-Sensitive PageRank
PageRank is an algorithm used by several search engines to rank web documents according to their assumed relevance and popularity deduced from the Web’s link structure. PageRank...
Sinan Al-Saffar, Gregory L. Heileman
NN
2002
Springer
136views Neural Networks» more  NN 2002»
13 years 7 months ago
Bayesian model search for mixture models based on optimizing variational bounds
When learning a mixture model, we suffer from the local optima and model structure determination problems. In this paper, we present a method for simultaneously solving these prob...
Naonori Ueda, Zoubin Ghahramani
ICCV
2011
IEEE
12 years 7 months ago
Optimal Landmark Detection using Shape Models and Branch and Bound
Fitting statistical 2D and 3D shape models to images is necessary for a variety of tasks, such as video editing and face recognition. Much progress has been made on local fitting...
Brian Amberg, Thomas Vetter
SODA
2008
ACM
100views Algorithms» more  SODA 2008»
13 years 9 months ago
A tight lower bound for parity in noisy communication networks
We show a tight lower bound of (N log log N) on the number of transmission required to compute the parity of N bits (with constant error) in a network of N randomly placed sensors...
Chinmoy Dutta, Yashodhan Kanoria, D. Manjunath, Ja...