451 search results - page 34 / 91 » Some Lower Bounds on Geometric Separability Problems |
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract—This paper is about designing optimal highthroughput hashing schemes that minimize the total number of memory accesses needed to build and access an hash table. Recent s...
ECCV
2002
Springer
15 years 11 months ago
2002
Springer
Estimating geometric structure from uncalibrated images accurately enough for high quality rendering is difficult. We present a method where only coarse geometric structure is trac...
104
click to vote
OSN
2007
14 years 9 months ago
2007
— We present a review of the various integer linear programming (ILP) formulations that have been proposed for the routing and wavelength assignment problem in WDM optical networ...
94
Voted
COR
2006
14 years 9 months ago
2006
Arc Routing Problems on mixed graphs have been modelled in the literature either using just one variable per edge or associating to each edge two variables, each one representing ...
COCOA
2010
Springer
14 years 7 months ago
2010
Springer
The classical and well-studied group testing problem is to find d defectives in a set of n elements by group tests, which tell us for any chosen subset whether it contains defectiv...