Sciweavers

1015 search results - page 141 / 203
» An efficient algorithm for AS path inferring
Sort
View
NIPS
2008
13 years 9 months ago
Counting Solution Clusters in Graph Coloring Problems Using Belief Propagation
We show that an important and computationally challenging solution space feature of the graph coloring problem (COL), namely the number of clusters of solutions, can be accurately...
Lukas Kroc, Ashish Sabharwal, Bart Selman
NIPS
2001
13 years 9 months ago
Latent Dirichlet Allocation
We describe latent Dirichlet allocation (LDA), a generative probabilistic model for collections of discrete data such as text corpora. LDA is a three-level hierarchical Bayesian m...
David M. Blei, Andrew Y. Ng, Michael I. Jordan
ECCV
2010
Springer
13 years 8 months ago
Object Recognition with Hierarchical Stel Models
Abstract. We propose a new generative model, and a new image similarity kernel based on a linked hierarchy of probabilistic segmentations. The model is used to efficiently segment ...
Alessandro Perina, Nebojsa Jojic, Umberto Castella...
PE
2002
Springer
124views Optimization» more  PE 2002»
13 years 7 months ago
Continuous-time hidden Markov models for network performance evaluation
In this paper, we study the use of continuous-time hidden Markov models (CT-HMMs) for network protocol and application performance evaluation. We develop an algorithm to infer the...
Wei Wei, Bing Wang, Donald F. Towsley
KI
2010
Springer
13 years 6 months ago
Situation-Specific Intention Recognition for Human-Robot Cooperation
Recognizing human intentions is part of the decision process in many technical devices. In order to achieve natural interaction, the required estimation quality and the used comput...
Peter Krauthausen, Uwe D. Hanebeck