229 search results - page 6 / 46 » Ergodic-Type Characterizations of Algorithmic Randomness |
TSP
2008
13 years 7 months ago
2008
Markov random fields are designed to represent structured dependencies among large collections of random variables, and are well-suited to capture the structure of real-world sign...
TASE
2008
IEEE
13 years 7 months ago
2008
IEEE
This work intends to deal with the optimal kinematic synthesis problem of parallel manipulators under a unified framework. Observing that regular (e.g., hyper-rectangular) workspac...
22
Voted
ICASSP
2009
IEEE
14 years 1 months ago
2009
IEEE
This paper analyzes the rate of convergence of greedy gossip with eavesdropping (GGE). In previous work, we proposed GGE, a fast gossip algorithm based on exploiting the broadcast...
JGAA
2007
13 years 7 months ago
2007
Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...
CISS
2008
IEEE
14 years 1 months ago
2008
IEEE
Abstract— We consider a joint randomized scheduling, congestion control mechanism for general wireless networks. We allow for a set of imperfections in the operation of the rando...