1541 search results - page 198 / 309 » Analysis of Random Noise and Random Walk Algorithms |
CORR
2002
Springer
13 years 8 months ago
2002
Springer
: We study the satisfiability of randomly generated formulas formed by M clauses of exactly K literals over N Boolean variables. For a given value of N the problem is known to be m...
ALGORITHMICA
1999
13 years 8 months ago
1999
Maxima in Rd are found incrementally by maintaining a linked list and comparing new elements against the linked list. If the elements are independent and uniformly distributed in t...
EGPGV
2004
Springer
14 years 1 months ago
2004
Springer
This paper investigates assignment strategies (load balancing algorithms) for process farms which solve the problem of online placement of a constant number of independent tasks w...
ICC
2007
IEEE
14 years 2 months ago
2007
IEEE
—Opportunistic scheduling in random beamforming maximizes the sum-rate by allocating resources to the users with the best channel condition, thus leveraging on multiuser diversit...
ISBI
2008
IEEE
14 years 9 months ago
2008
IEEE
In this paper, we present a novel object-based statistical colocalization method. Our colocalization relies on multiple hypothesis tests on the distances between all pairs of the ...