2252 search results - page 132 / 451 » Lower Bounds for Dynamic Algorithms |
104
click to vote
MICRO
1999
IEEE
15 years 7 months ago
1999
IEEE
Since there is generally insufficient instruction level parallelism within a single basic block, higher performance is achieved by speculatively scheduling operations in superbloc...
131
click to vote
SODA
2008
ACM
15 years 4 months ago
2008
ACM
Ranged hash functions generalize hash tables to the setting where hash buckets may come and go over time, a typical case in distributed settings where hash buckets may correspond ...
102
click to vote
FOCS
2008
IEEE
15 years 9 months ago
2008
IEEE
We use a Bayesian approach to optimally solve problems in noisy binary search. We deal with two variants: • Each comparison is erroneous with independent probability 1 − p. â€...
148
click to vote
CVPR
2011
IEEE
15 years 3 days ago
2011
IEEE
The goal of natural image denoising is to estimate a clean version of a given noisy image, utilizing prior knowledge on the statistics of natural images. The problem has been stud...
119
Voted
STOC
2010
ACM
16 years 22 days ago
2010
ACM
We initiate a direction for proving lower bounds on the size of non-commutative arithmetic circuits. This direction is based on a connection between lower bounds on the size of no...