427 search results - page 84 / 86 » A Subexponential Bound for Linear Programming |
166
click to vote
INFOCOM
2007
IEEE
15 years 11 months ago
2007
IEEE
Abstract— High-speed wireless communication technology (e.g. WiMAX) makes it feasible and cost-effective to build wireless back-hauls for Internet access. Compared to wired count...
158
click to vote
ICALP
2007
Springer
15 years 11 months ago
2007
Springer
d Abstract) Paul Beame1, , Matei David2, , Toniann Pitassi2, , and Philipp Woelfel2,† 1 University of Washington 2 University of Toronto Abstract. We solve some fundamental probl...
156
click to vote
CVPR
2010
IEEE
15 years 11 months ago
2010
IEEE
The explosive growth of the vision data motivates the recent studies on efficient data indexing methods such as locality-sensitive hashing (LSH). Most existing approaches perform...
137
click to vote
SIGECOM
2003
ACM
15 years 10 months ago
2003
ACM
We investigate the problem of matching buyers and sellers in a multi-item multi-unit combinatorial exchange so as to maximize either the surplus (revenue minus cost) or the tradin...
148
click to vote
COMPGEOM
2010
ACM
15 years 10 months ago
2010
ACM
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...