5153 search results - page 314 / 1031 » Introduction to Randomized Algorithms |
152
click to vote
STOC
2001
ACM
16 years 4 months ago
2001
ACM
Given a matrix A, it is often desirable to find a good approximation to A that has low rank. We introduce a simple technique for accelerating the computation of such approximation...
146
click to vote
SODA
2008
ACM
15 years 5 months ago
2008
ACM
We investigate the problem of monotonicity reconstruction, as defined in [3], in a parallel setting. We have oracle access to a nonnegative real-valued function f defined on domai...
146
click to vote
ICMCS
2010
IEEE
15 years 2 months ago
2010
IEEE
In a multiview-imaging setting, image-acquisition costs could be substantially diminished if some of the cameras operate at a reduced quality. Compressed sensing is proposed to ef...
144
Voted
STACS
2005
Springer
15 years 9 months ago
2005
Springer
Exponential algorithms, i.e. algorithms of complexity O(cn ) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem ...
137
click to vote
MSWIM
2004
ACM
15 years 9 months ago
2004
ACM
Most comparisons of wireless ad hoc routing algorithms involve simulated or indoor trial runs, or outdoor runs with only a small number of nodes, potentially leading to an incorre...