447 search results - page 75 / 90 » Approximation Algorithms for the Discrete Time-Cost Tradeoff... |
KDD
2001
ACM
14 years 8 months ago
2001
ACM
The problem of similarity search (query-by-content) has attracted much research interest. It is a difficult problem because of the inherently high dimensionality of the data. The ...
INFOCOM
2012
IEEE
11 years 11 months ago
2012
IEEE
— Reliability and energy efficiency are critical issues in wireless sensor networks. In this work, we study Delay-bounded Energy-constrained Adaptive Routing (DEAR) problem with...
IROS
2009
IEEE
14 years 3 months ago
2009
IEEE
Abstract— LDP (Locally Distributed Predicates) is a distributed, high-level language for programming modular reconfigurable robot systems (MRRs). In this paper we present the im...
MP
2007
13 years 8 months ago
2007
We consider machine scheduling on unrelated parallel machines with the objective to minimize the schedule makespan. We assume that, in addition to its machine dependence, the proce...
ICCV
2009
IEEE
15 years 1 months ago
2009
IEEE
The concept of graph cuts is by now a standard method
for all sorts of low level vision problems. Its popularity is
largely due to the fact that globally or near globally optimal...