207 search results - page 33 / 42 » Improved Approximation Algorithm for Connected Facility Loca... |
IPSN
2009
Springer
15 years 6 months ago
2009
Springer
We consider the problem of monitoring spatial phenomena, such as road speeds on a highway, using wireless sensors with limited battery life. A central question is to decide where ...
CORR
2008
Springer
14 years 11 months ago
2008
Springer
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
CVPR
2012
IEEE
13 years 2 months ago
2012
IEEE
A popular approach to pixel labeling problems, such as multiclass image segmentation, is to construct a pairwise conditional Markov random field (CRF) over image pixels where the...
CORR
2007
Springer
14 years 11 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 × ...
104
click to vote
PVLDB
2008
14 years 11 months ago
2008
In this paper we propose a novel document retrieval model in which text queries are augmented with multi-dimensional taxonomy restrictions. These restrictions may be relaxed at a ...