Sciweavers

28888 search results - page 271 / 5778
» Computability and complexity in analysis
Sort
View
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
16 years 24 days 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...
LCTRTS
2010
Springer
16 years 1 months ago
Elastic computing: a framework for transparent, portable, and adaptive multi-core heterogeneous computing
Over the past decade, system architectures have started on a clear trend towards increased parallelism and heterogeneity, often resulting in speedups of 10x to 100x. Despite numer...
John Robert Wernsing, Greg Stitt
CVPR
1996
IEEE
15 years 10 months ago
Extracting Salient Curves from Images: An Analysis of the Saliency Network
The Saliency Network proposed by Shashua and Ullman (1988) is a well-known approach to the problem of extracting salient curves from images while performing gap completion. This pa...
T. D. Alter, Ronen Basri
WISEC
2010
ACM
15 years 11 months ago
Secret keys from entangled sensor motes: implementation and analysis
Key management in wireless sensor networks does not only face typical, but also several new challenges. The scale, resource limitations, and new threats such as node capture and c...
Matthias Wilhelm, Ivan Martinovic, Jens B. Schmitt
CVPR
1997
IEEE
16 years 8 months ago
Learning Parameterized Models of Image Motion
A framework for learning parameterized models of optical flow from image sequences is presented. A class of motions is represented by a set of orthogonal basis flow fields that ar...
Michael J. Black, Yaser Yacoob, Allan D. Jepson, D...