Sciweavers

1578 search results - page 50 / 316
» Algorithmic randomness of continuous functions
Sort
View
VMV
2001
209views Visualization» more  VMV 2001»
14 years 11 days ago
A Novel Probabilistic Model for 3D Object Recognition: Spin-Glass Markov Random Fields
This contribution presents a new class of MRF, that is inspired by methods of statistical physics. The new energy function assumes full-connectivity in the neighborhood system and...
Barbara Caputo, Sahla Bouattour, Dietrich Paulus
APPROX
2006
Springer
91views Algorithms» more  APPROX 2006»
14 years 2 months ago
Threshold Functions for Asymmetric Ramsey Properties Involving Cliques
Consider the following problem: For given graphs G and F1, . . . , Fk, find a coloring of the edges of G with k colors such that G does not contain Fi in color i. For example, if e...
Martin Marciniszyn, Jozef Skokan, Reto Spöhel...
ATAL
2009
Springer
14 years 5 months ago
Planning with continuous resources for agent teams
Many problems of multiagent planning under uncertainty require distributed reasoning with continuous resources and resource limits. Decentralized Markov Decision Problems (Dec-MDP...
Janusz Marecki, Milind Tambe
FOCS
2009
IEEE
14 years 5 months ago
Faster Generation of Random Spanning Trees
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
Jonathan A. Kelner, Aleksander Madry
INFOCOM
2011
IEEE
13 years 2 months ago
Continuous multi-dimensional top-k query processing in sensor networks
—Top-k query has long been an important topic in many fields of computer science. Efficient implementation of the top-k queries is the key for information searching. With the n...
Hongbo Jiang, Jie Cheng, Dan Wang, Chonggang Wang,...