5580 search results - page 653 / 1116 » Randomized priority algorithms |
163
click to vote
ICIP
2009
IEEE
15 years 2 months ago
2009
IEEE
Leading compressed sensing (CS) methods require m = O (k log(n)) compressive samples to perfectly reconstruct a k-sparse signal x of size n using random projection matrices (e.g., ...
178
Voted
ICDE
2011
IEEE
14 years 8 months ago
2011
IEEE
— The study of skylines and their variants has received considerable attention in recent years. Skylines are essentially sets of most interesting (undominated) tuples in a databa...
189
Voted
ICDCN
2011
Springer
14 years 8 months ago
2011
Springer
We address the problem of designing distributed algorithms for large scale networks that are robust to Byzantine faults. We consider a message passing, full information model: the ...
150
click to vote
SAC
2010
ACM
15 years 11 months ago
2010
ACM
Byzantine consensus in asynchronous message-passing systems has been shown to require at least 3f + 1 processes to be solvable in several system models (e.g., with failure detecto...
109
click to vote
CRYPTO
2009
Springer
15 years 11 months ago
2009
Springer
In the Hidden Number Problem (HNP), the goal is to find a hidden number s, when given p, g and access to an oracle that on query a returns the k most significant bits of s · ga ...