630 search results - page 37 / 126 » Hardness results for approximating the bandwidth |
154
click to vote
SIAMCOMP
2000
15 years 5 months ago
2000
We consider the problem of designing a near-optimal linear decision tree to classify two given point sets B and W in n. A linear decision tree de nes a polyhedral subdivision of sp...
150
click to vote
WG
2007
Springer
16 years 7 days ago
2007
Springer
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
143
click to vote
ERLANG
2003
ACM
15 years 11 months ago
2003
ACM
This paper presents a soft-typing system for the programming language Erlang. The system is based on two concepts; a (forward) data flow analysis that determines upper approximat...
166
click to vote
PODS
2008
ACM
16 years 6 months ago
2008
ACM
There is an increasing quantity of data with uncertainty arising from applications such as sensor network measurements, record linkage, and as output of mining algorithms. This un...
145
click to vote
SIGECOM
2006
ACM
16 years 2 days ago
2006
ACM
We present approximation and online algorithms for a number of problems of pricing items for sale so as to maximize seller’s revenue in an unlimited supply setting. Our first r...