207 search results - page 38 / 42 » The Polynomial Method for Random Matrices |
ICCV
2009
IEEE
15 years 11 days 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...
INFOCOM
2007
IEEE
14 years 1 months ago
2007
IEEE
—We introduce a novel approach to multi-hop routing in wireless networks. Instead of the usual graph description we characterize the network by the packet delivery ratio matrix w...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
In this paper we propose a genetic programming approach to learning stochastic models with unsymmetrical noise distributions. Most learning algorithms try to learn from noisy data...
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
We convert cell-probe lower bounds for polynomial space into stronger lower bounds for near-linear space. Our technique applies to any lower bound proved through the richness meth...
ICALP
2001
Springer
13 years 12 months ago
2001
Springer
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...