Sciweavers

62 search results - page 11 / 13
» On Empirical Meaning of Randomness with Respect to a Real Pa...
Sort
View
ECCV
2004
Springer
14 years 8 months ago
Evaluation of Robust Fitting Based Detection
Low-level image processing algorithms generally provide noisy features that are far from being Gaussian. Medium-level tasks such as object detection must therefore be robust to out...
Sio-Song Ieng, Jean-Philippe Tarel, Pierre Charbon...
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
14 years 1 months ago
On the runtime analysis of the 1-ANT ACO algorithm
The runtime analysis of randomized search heuristics is a growing field where, in the last two decades, many rigorous results have been obtained. These results, however, apply pa...
Benjamin Doerr, Frank Neumann, Dirk Sudholt, Carst...
JNW
2008
115views more  JNW 2008»
13 years 7 months ago
On the Interaction Between Multiple Paths and Wireless Mesh Networks Scheduler Approaches
Multi-path routing allows building and use of multiple paths for routing between a source-destination pair. This paper investigates the problem of selecting multiple routing paths ...
Valeria Loscrì
BMCBI
2005
127views more  BMCBI 2005»
13 years 7 months ago
Are scale-free networks robust to measurement errors?
Background: Many complex random networks have been found to be scale-free. Existing literature on scale-free networks has rarely considered potential false positive and false nega...
Nan Lin, Hongyu Zhao
DATAMINE
2007
110views more  DATAMINE 2007»
13 years 7 months ago
The complexity of non-hierarchical clustering with instance and cluster level constraints
Recent work has looked at extending clustering algorithms with instance level must-link (ML) and cannot-link (CL) background information. Our work introduces δ and ǫ cluster lev...
Ian Davidson, S. S. Ravi