10608 search results - page 2 / 2122 » Complexity of O'Hara's Algorithm |
LCC
1994
13 years 9 months ago
1994
COCO
1989
Springer
13 years 9 months ago
1989
Springer
COMGEO
2008
ACM
13 years 5 months ago
2008
ACM
The flow complex is a geometric structure, similar to the Delaunay tessellation, to organize a set of (weighted) points in Rk. Flow shapes are topological spaces corresponding to ...
STOC
2012
ACM
11 years 7 months ago
2012
ACM
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
ICC
2007
IEEE
13 years 11 months ago
2007
IEEE
This paper presents an analytical approach to evaluate the expected complexity of a generalized sphere decoding (GSD) algorithm, GSDλ − , for underdetermined integer leastsquare...