5153 search results - page 360 / 1031 » Introduction to Randomized Algorithms |
138
click to vote
SIAMCOMP
2010
15 years 2 months ago
2010
Let G = (V, E) be a weighted undirected graph having non-negative edge weights. An estimate ˆδ(u, v) of the actual distance δ(u, v) between u, v ∈ V is said to be of stretch t...
158
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
Due to multipath delay spread and relatively high sampling rate in OFDM systems, the channel estimation is formulated as a sparse recovery problem, where a hybrid compressed sensi...
130
click to vote
ICCV
2009
IEEE
16 years 9 months ago
2009
IEEE
This paper is focused on the Co-segmentation problem
[1] – where the objective is to segment a similar object from
a pair of images. The background in the two images may be
ar...
150
click to vote
ICML
2007
IEEE
16 years 5 months ago
2007
IEEE
Neighbor search is a fundamental task in machine learning, especially in classification and retrieval. Efficient nearest neighbor search methods have been widely studied, with the...
147
click to vote
DCC
2003
IEEE
16 years 4 months ago
2003
IEEE
Nguyen and Shparlinski recently presented a polynomial-time algorithm that provably recovers the signer's secret DSA key when a few bits of the random nonces k (used at each s...