Sciweavers

1480 search results - page 211 / 296
» Distributed algorithms for weighted problems in sparse graph...
Sort
View
SDM
2009
SIAM
160views Data Mining» more  SDM 2009»
15 years 10 months ago
Discovering Substantial Distinctions among Incremental Bi-Clusters.
A fundamental task of data analysis is comprehending what distinguishes clusters found within the data. We present the problem of mining distinguishing sets which seeks to find s...
Faris Alqadah, Raj Bhatnagar
GECCO
2006
Springer
179views Optimization» more  GECCO 2006»
15 years 4 months ago
Parisian evolution with honeybees for three-dimensional reconstruction
This paper introduces a novel analogy with the way in which honeybee colonies operate in order to solve the problem of sparse and quasi dense reconstruction. To successfully solve...
Gustavo Olague, Cesar Puente
PDP
2003
IEEE
15 years 6 months ago
Scheduling strategies for mixed data and task parallelism on heterogeneous clusters and grids
We consider the execution of a complex application on a heterogeneous "grid" computing platform. The complex application consists of a suite of identical, independent pr...
Olivier Beaumont, Arnaud Legrand, Yves Robert
ICRA
2009
IEEE
148views Robotics» more  ICRA 2009»
15 years 7 months ago
Graph-based robust shape matching for robotic application
— Shape is one of the useful information for object detection. The human visual system can often recognize objects based on the 2-D outline shape alone. In this paper, we address...
Hanbyul Joo, Yekeun Jeong, Olivier Duchenne, Seong...
ICASSP
2010
IEEE
15 years 1 months ago
Disparity search range estimation: Enforcing temporal consistency
This paper presents a new approach for estimating the disparity search range in stereo video that enforces temporal consistency. Reliable search range estimation is very important...
Dongbo Min, Sehoon Yea, Zafer Arican, Anthony Vetr...