2957 search results - page 395 / 592 » The Complexity of Polynomial-Time Approximation |
150
click to vote
COMPGEOM
2009
ACM
16 years 1 months ago
2009
ACM
It was shown in [11] that any orientable graph of genus g can be probabilistically embedded into a graph of genus g − 1 with constant distortion. Removing handles one by one giv...
152
click to vote
RECSYS
2009
ACM
16 years 1 months ago
2009
ACM
We consider the problem of recommending the best set of k items when there is an inherent ordering between items, expressed as a set of prerequisites (e.g., the course ‘Real Ana...
162
click to vote
NICSO
2010
Springer
16 years 1 months ago
2010
Springer
We investigate the search properties of pre-evolutionary random catalytic reaction networks, where reactions might be reversible, and replication is not taken for granted. Since it...
168
click to vote
ICASSP
2008
IEEE
16 years 28 days ago
2008
IEEE
It is well known that high-dimensional nearest-neighbor retrieval is very expensive. Many signal processing methods suffer from this computing cost. Dramatic performance gains can...
149
click to vote
ICPR
2008
IEEE
16 years 28 days ago
2008
IEEE
We propose a new method for recovering a 3-D object shape from an image sequence. In order to recover high-resolution relative depth without using the complex Markov random field...