427 search results - page 48 / 86 » Computing the Local Consensus of Trees |
159
click to vote
IPMU
1992
Springer
15 years 9 months ago
1992
Springer
This paper deals with the problem of inference under uncertain information. This is a generalization of a paper of Cardona et al. (1991a) where rules were not allowed to contain n...
143
click to vote
CP
2008
Springer
15 years 6 months ago
2008
Springer
Decomposition is a powerful technique for reducing the size of a backtracking search tree. However, when solving constraint optimization problems (COP's) the standard techniqu...
154
Voted
SODA
2008
ACM
15 years 6 months ago
2008
ACM
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...
140
click to vote
CVPR
2010
IEEE
16 years 1 months ago
2010
IEEE
We present a method to classify and localize human actions in video using a Hough transform voting framework. Random trees are trained to learn a mapping between densely-sampled f...
146
click to vote
COREGRID
2007
Springer
15 years 11 months ago
2007
Springer
This paper deals with the replica placement problem on fully homogeneous tree networksknownasthe Replica Placementoptimizationproblem. Theclient requests are known beforehand, whil...