Sciweavers

2479 search results - page 261 / 496
» Random Event Structures
Sort
View
CVPR
2010
IEEE
16 years 2 months ago
Automatic Discovery of Meaningful Object Parts with Latent CRFs
Object recognition is challenging due to high intra-class variability caused, e.g., by articulation, viewpoint changes, and partial occlusion. Successful methods need to strike a...
Paul Schnitzspan, Stefan Roth, Bernt Schiele
ATAL
2009
Springer
16 years 1 months ago
Self-organising agent organisations
Self-organising multi-agent systems provide a suitable paradigm for developing autonomic computing systems that manage themselves. Towards this goal, we demonstrate a robust, dece...
Ramachandra Kota, Nicholas Gibbins, Nicholas R. Je...
MOBIQUITOUS
2007
IEEE
16 years 25 days ago
Assessing Standard and Inverted Skip Graphs Using Multi-Dimensional Range Queries and Mobile Nodes
—The skip graph, an application-layer data structure for routing and indexing, may be used in a sensor network to facilitate queries of the distributed k-dimensional data collect...
Gregory J. Brault, Christopher J. Augeri, Barry E....
ISAAC
2005
Springer
123views Algorithms» more  ISAAC 2005»
16 years 2 days ago
Sampling Unlabeled Biconnected Planar Graphs
We present an expected polynomial time algorithm to generate a 2-connected unlabeled planar graph uniformly at random. To do this we first derive recurrence formulas to count the ...
Manuel Bodirsky, Clemens Gröpl, Mihyun Kang
CDC
2009
IEEE
124views Control Systems» more  CDC 2009»
15 years 11 months ago
The Kalman like particle filter: Optimal estimation with quantized innovations/measurements
— We study the problem of optimal estimation using quantized innovations, with application to distributed estimation over sensor networks. We show that the state probability dens...
Ravi Teja Sukhavasi, Babak Hassibi