Sciweavers

765 search results - page 10 / 153
» Empirical Design of Geometric Algorithms
Sort
View
MASCOTS
2008
13 years 8 months ago
Optimal Layered Multicast with Network Coding: Mathematical Model and Empirical Studies
Abstract--Recent advances in network coding research dramatically changed the underlying structure of optimal multicast routing algorithms and made them efficiently computable. Whi...
Ajay Gopinathan, Zongpeng Li
GECCO
2005
Springer
143views Optimization» more  GECCO 2005»
14 years 28 days ago
Solving geometric TSP with ants
This paper presents an ant-based approach for solving the Traveling Salesman Problem (TSP). Novel concepts of this algorithm that distinguish it from the other heuristics are the ...
Thang Nguyen Bui, Mufit Colpan
CP
1997
Springer
13 years 11 months ago
Five Pitfalls of Empirical Scheduling Research
A number of pitfalls of empirical scheduling research are illustrated using real experimental data. These pitfalls, in general, serve to slow the progress of scheduling research b...
J. Christopher Beck, Andrew J. Davenport, Mark S. ...
ECCV
2004
Springer
14 years 24 days ago
AQUATICS Reconstruction Software: The Design of a Diagnostic Tool Based on Computer Vision Algorithms
Computer vision methods can be applied to a variety of medical and surgical applications, and many techniques and algorithms are available that can be used to recover 3D shapes and...
Andrea Giachetti, Gianluigi Zanetti
COMPGEOM
2011
ACM
12 years 11 months ago
Compressive sensing with local geometric features
We propose a framework for compressive sensing of images with local geometric features. Specifically, let x ∈ RN be an N-pixel image, where each pixel p has value xp. The image...
Rishi Gupta, Piotr Indyk, Eric Price, Yaron Rachli...