Sciweavers

7228 search results - page 16 / 1446
» From Algorithmic to Subjective Randomness
Sort
View
69
Voted
ATAL
2009
Springer
15 years 4 months ago
Analyzing the performance of randomized information sharing
In large, collaborative, heterogeneous teams, team members often collect information that is useful to other members of the team. Recognizing the utility of such information and d...
Prasanna Velagapudi, Oleg A. Prokopyev, Katia P. S...
3DOR
2008
15 years 1 days ago
Markov Random Fields for Improving 3D Mesh Analysis and Segmentation
Mesh analysis and clustering have became important issues in order to improve the efficiency of common processing operations like compression, watermarking or simplification. In t...
Guillaume Lavoué, Christian Wolf
SIGECOM
2006
ACM
143views ECommerce» more  SIGECOM 2006»
15 years 3 months ago
Braess's paradox in large random graphs
Braess’s Paradox is the counterintuitive but well-known fact that removing edges from a network with “selfish routing” can decrease the latency incurred by traffic in an eq...
Gregory Valiant, Tim Roughgarden
SIGIR
2006
ACM
15 years 3 months ago
Answering complex questions with random walk models
We present a novel framework for answering complex questions that relies on question decomposition. Complex questions are decomposed by a procedure that operates on a Markov chain...
Sanda M. Harabagiu, V. Finley Lacatusu, Andrew Hic...
ATAL
2008
Springer
14 years 11 months ago
Multi-robot Markov random fields
We propose Markov random fields (MRFs) as a probabilistic mathematical model for unifying approaches to multi-robot coordination or, more specifically, distributed action selectio...
Jesse Butterfield, Odest Chadwicke Jenkins, Brian ...