Sciweavers

5580 search results - page 970 / 1116
» Randomized priority algorithms
Sort
View
ISAAC
2003
Springer
129views Algorithms» more  ISAAC 2003»
14 years 2 months ago
Polynomial Time Approximate Sampler for Discretized Dirichlet Distribution
Abstract. In this paper, we propose a Markov chain for sampling a random vector distributed according to a discretized Dirichlet distribution. We show that our Markov chain is rapi...
Tomomi Matsui, Mitsuo Motoki, Naoyuki Kamatani
DATE
2010
IEEE
161views Hardware» more  DATE 2010»
14 years 2 months ago
BISD: Scan-based Built-In self-diagnosis
Abstract—Built-In Self-Test (BIST) is less often applied to random logic than to embedded memories due to the following reasons: Firstly, for a satisfiable fault coverage it may...
Melanie Elm, Hans-Joachim Wunderlich
TAMC
2010
Springer
14 years 2 months ago
Community Structure in Large Complex Networks
In this paper, we establish the definition of community fundamentally different from what was commonly accepted in previous studies, where communities were typically assumed to ...
Liaoruo Wang, John E. Hopcroft
FOCS
2002
IEEE
14 years 2 months ago
Covering Problems with Hard Capacities
We consider the classical vertex cover and set cover problems with the addition of hard capacity constraints. This means that a set (vertex) can only cover a limited number of its...
Julia Chuzhoy, Joseph Naor
ICNP
2002
IEEE
14 years 2 months ago
Hybrid Channel Access Scheduling in Ad Hoc Networks
We present the hybrid activation multiple access (HAMA) protocol for ad hoc networks. Unlike previous channel access scheduling protocols that activate either nodes or links only,...
Lichun Bao, J. J. Garcia-Luna-Aceves