Sciweavers

752 search results - page 60 / 151
» A Markov Chain Model Checker
Sort
View
STOC
2002
ACM
149views Algorithms» more  STOC 2002»
14 years 9 months ago
The complexity of choosing an H-colouring (nearly) uniformly at random
Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. Special cases of this problem include sampling colourings and independent sets a...
Leslie Ann Goldberg, Steven Kelk, Mike Paterson
TKDE
2011
362views more  TKDE 2011»
13 years 3 months ago
A Link Analysis Extension of Correspondence Analysis for Mining Relational Databases
—This work introduces a link-analysis procedure for discovering relationships in a relational database or a graph, generalizing both simple and multiple correspondence analysis. ...
Luh Yen, Marco Saerens, François Fouss
CVPR
2005
IEEE
14 years 10 months ago
Using Particles to Track Varying Numbers of Interacting People
In this paper, we present a Bayesian framework for the fully automatic tracking of a variable number of interacting targets using a fixed camera. This framework uses a joint multi...
Kevin Smith, Daniel Gatica-Perez, Jean-Marc Odobez
DAGM
2007
Springer
14 years 2 months ago
Extraction of 3D Unfoliaged Trees from Image Sequences Via a Generative Statistical Approach
In this paper we propose a generative statistical approach for the three dimensional (3D) extraction of the branching structure of unfoliaged deciduous trees from urban image seque...
Hai Huang, Helmut Mayer
IPSN
2004
Springer
14 years 2 months ago
A probabilistic approach to inference with limited information in sensor networks
We present a methodology for a sensor network to answer queries with limited and stochastic information using probabilistic techniques. This capability is useful in that it allows...
Rahul Biswas, Sebastian Thrun, Leonidas J. Guibas