10608 search results - page 190 / 2122 » Complexity of O'Hara's Algorithm |
KBSE
2007
IEEE
14 years 5 months ago
2007
IEEE
Programmers have long used assertions to characterize properties of code. An assertion violation signals a corruption in the program state. At such a state, it is standard to term...
CIE
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
INFOCOM
2006
IEEE
14 years 4 months ago
2006
IEEE
— We study the complexity of a spectrum of design problems for optical networks in order to carry a set of demands. Under wavelength division multiplexing (WDM) technology, deman...
ICALP
2004
Springer
14 years 4 months ago
2004
Springer
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
COLT
1993
Springer
14 years 2 months ago
1993
Springer
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...