Sciweavers

9842 search results - page 1767 / 1969
» Problem complexity
Sort
View
SIGECOM
2006
ACM
119views ECommerce» more  SIGECOM 2006»
16 years 13 days ago
Nash equilibria in graphical games on trees revisited
Graphical games have been proposed as a game-theoretic model of large-scale distributed networks of non-cooperative agents. When the number of players is large, and the underlying...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...
CCCG
2008
15 years 8 months ago
Exact Pareto-Optimal Coordination of Two Translating Polygonal Robots on a Cyclic Roadmap
We consider planning optimal collision-free motions of two polygonal robots under translation. Each robot has a reference point that must lie on a given graph, called a roadmap, w...
Hamid Reza Chitsaz, Steven M. LaValle, Jason M. O'...
CVPR
2006
IEEE
16 years 8 months ago
Escaping local minima through hierarchical model selection: Automatic object discovery, segmentation, and tracking in video
Recently, the generative modeling approach to video segmentation has been gaining popularity in the computer vision community. For example, the flexible sprites framework has been...
Nebojsa Jojic, John M. Winn, Larry Zitnick
CVPR
2006
IEEE
16 years 8 months ago
Clustering Appearance for Scene Analysis
We propose a new approach called "appearance clustering" for scene analysis. The key idea in this approach is that the scene points can be clustered according to their s...
Sanjeev J. Koppal, Srinivasa G. Narasimhan
CVPR
2006
IEEE
16 years 8 months ago
Gesture Recognition using Hidden Markov Models from Fragmented Observations
We consider the problem of computing the likelihood of a gesture from regular, unaided video sequences, without relying on perfect segmentation of the scene. Instead of requiring ...
Ruiduo Yang, Sudeep Sarkar
« Prev « First page 1767 / 1969 Last » Next »