Sciweavers

4110 search results - page 256 / 822
» Efficient algorithms for the 2-gathering problem
Sort
View
ISER
2000
Springer
80views Robotics» more  ISER 2000»
15 years 10 months ago
Robot Navigation for Automatic Model Construction Using Safe Regions
: Automatic model construction is a core problem in mobile robotics. To solve this task efficiently, we need a motion strategy to guide a robot equipped with a range sensor through...
Héctor H. González-Baños, Jea...
HIS
2009
15 years 4 months ago
Scheduling Meta-Tasks in Distributed Heterogeneous Computing Systems: A Meta-Heuristic Particle Swarm Optimization Approach
Scheduling is a key problem in distributed heterogeneous computing systems in order to benefit from the large computing capacity of such systems and is an NP-complete problem. In ...
Hesam Izakian, Ajith Abraham, Václav Sn&aac...
CVPR
2008
IEEE
16 years 8 months ago
Reduce, reuse & recycle: Efficiently solving multi-label MRFs
In this paper, we present novel techniques that improve the computational and memory efficiency of algorithms for solving multi-label energy functions arising from discrete MRFs o...
Karteek Alahari, Pushmeet Kohli, Philip H. S. Torr
ICDE
2006
IEEE
165views Database» more  ICDE 2006»
16 years 8 months ago
Efficient Continuous Skyline Computation
In a number of emerging streaming applications, the data values that are produced have an associated time interval for which they are valid. A useful computation over such streami...
Michael D. Morse, Jignesh M. Patel, William I. Gro...
KDD
2006
ACM
150views Data Mining» more  KDD 2006»
16 years 7 months ago
Maximally informative k-itemsets and their efficient discovery
In this paper we present a new approach to mining binary data. We treat each binary feature (item) as a means of distinguishing two sets of examples. Our interest is in selecting ...
Arno J. Knobbe, Eric K. Y. Ho