Sciweavers

4565 search results - page 574 / 913
» Time Optimal Self-Stabilizing Algorithms
Sort
View
129
Voted
GECCO
2008
Springer
196views Optimization» more  GECCO 2008»
15 years 4 months ago
ADANN: automatic design of artificial neural networks
In this work an improvement of an initial approach to design Artificial Neural Networks to forecast Time Series is tackled, and the automatic process to design Artificial Neural N...
Juan Peralta, Germán Gutiérrez, Arac...
CVPR
2007
IEEE
16 years 5 months ago
Linear and Quadratic Subsets for Template-Based Tracking
We propose a method that dramatically improves the performance of template-based matching in terms of size of convergence region and computation time. This is done by selecting a ...
Selim Benhimane, Alexander Ladikos, Vincent Lepeti...
220
Voted
ICDE
2007
IEEE
113views Database» more  ICDE 2007»
16 years 4 months ago
Reducing Order Enforcement Cost in Complex Query Plans
Algorithms that exploit sort orders are widely used to implement joins, grouping, duplicate elimination and other set operations. Query optimizers traditionally deal with sort ord...
Ravindra Guravannavar, S. Sudarshan
152
Voted
WWW
2005
ACM
16 years 4 months ago
WEBCAP: a capacity planning tool for web resource management
A staggering number of multimedia applications are being introduced every day. Yet, the inordinate delays encountered in retrieving multimedia documents make it difficult to use t...
Sami Habib, Maytham Safar
CC
2010
Springer
117views System Software» more  CC 2010»
15 years 10 months ago
Punctual Coalescing
Compilers use register coalescing to avoid generating code for copy instructions. For architectures with register aliasing such as x86, Smith, Ramsey, and Holloway (2004) presented...
Fernando Magno Quintão Pereira, Jens Palsbe...