Sciweavers

1067 search results - page 195 / 214
» Probabilistic regular graphs
Sort
View
DIALM
2008
ACM
135views Algorithms» more  DIALM 2008»
15 years 2 months ago
Symmetric range assignment with disjoint MST constraints
If V is a set of n points in the unit square [0, 1]2 , and if R : V + is an assignment of positive real numbers (radii) to to those points, define a graph G(R) as follows: {v, w}...
Eric Schmutz
93
Voted
NIPS
2003
15 years 1 months ago
An Improved Scheme for Detection and Labelling in Johansson Displays
Consider a number of moving points, where each point is attached to a joint of the human body and projected onto an image plane. Johannson showed that humans can effortlessly det...
Claudio Fanti, Marzia Polito, Pietro Perona
NIPS
2003
15 years 1 months ago
Attractive People: Assembling Loose-Limbed Models using Non-parametric Belief Propagation
The detection and pose estimation of people in images and video is made challenging by the variability of human appearance, the complexity of natural scenes, and the high dimensio...
Leonid Sigal, Michael Isard, Benjamin H. Sigelman,...
CORR
2010
Springer
93views Education» more  CORR 2010»
15 years 15 days ago
Randomness for Free
We consider two-player zero-sum games on graphs. These games can be classified on the basis of the information of the players and on the mode of interaction between them. On the ba...
Krishnendu Chatterjee, Laurent Doyen, Hugo Gimbert...
106
Voted
CORR
2007
Springer
91views Education» more  CORR 2007»
15 years 11 days ago
Single-Exclusion Number and the Stopping Redundancy of MDS Codes
—For a linear block code C, its stopping redundancy is defined as the smallest number of check nodes in a Tanner graph for C, such that there exist no stopping sets of size smal...
Junsheng Han, Paul H. Siegel, Ron M. Roth