3875 search results - page 442 / 775 » Approximation algorithms for the 0-extension problem |
177
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
The problem of finding "small" sets that meet every straight-line which intersects a given convex region was initiated by Mazurkiewicz in 1916. We call such a set an opa...
165
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
The k-forest problem is a common generalization of both the k-MST and the dense-k-subgraph problems. Formally, given a metric space on n vertices V , with m demand pairs ⊆ V × ...
180
click to vote
ML
2008
ACM
15 years 6 months ago
2008
ACM
Abstract. We consider a large volume principle for transductive learning that prioritizes the transductive equivalence classes according to the volume they occupy in hypothesis spa...
156
click to vote
ICANNGA
2007
Springer
16 years 27 days ago
2007
Springer
Abstract. In wireless sensor networks where sensors are geographically deployed in 3D spaces, a mobile robot is required to travel to each sensor in order to download the data. The...
151
click to vote
WEA
2005
Springer
16 years 6 days ago
2005
Springer
We present the problem of statically distributing instructions of a common programming language, a problem which we prove equivalent to the multiterminal cut problem. We design eï¬...