Sciweavers

371 search results - page 41 / 75
» An anytime algorithm for optimal coalition structure generat...
Sort
View
ISCAS
2003
IEEE
169views Hardware» more  ISCAS 2003»
14 years 29 days ago
Efficient implementation of complex exponentially-modulated filter banks
In Exponentially-ModulatedFilter Bank (EMFB) the complex subfilters are generated from a real-valued prototype filter by multiplying the filter impulse response with complex expon...
Juuso Alhava, Ari Viholainen, Markku Renfors
CIAC
1994
Springer
148views Algorithms» more  CIAC 1994»
13 years 11 months ago
Efficient Reorganization of Binary Search Trees
We consider the problem of maintaining a binary search tree (BST) that minimizes the average access cost needed to satisfy randomly generated requests. We analyze scenarios in whi...
Micha Hofri, Hadas Shachnai
EVOW
2009
Springer
14 years 9 days ago
Finding Balanced Incomplete Block Designs with Metaheuristics
This paper deals with the generation of balanced incomplete block designs (BIBD), a hard constrained combinatorial problem with multiple applications. This problem is here formulat...
David Rodríguez Rueda, Carlos Cotta, Antoni...
CVPR
2005
IEEE
14 years 9 months ago
Shape Regularized Active Contour Using Iterative Global Search and Local Optimization
Recently, nonlinear shape models have been shown to improve the robustness and flexibility of segmentation. In this paper, we propose Shape Regularized Active Contour (ShRAC) that...
Tianli Yu, Jiebo Luo, Narendra Ahuja
ICS
2007
Tsinghua U.
14 years 1 months ago
Optimization of data prefetch helper threads with path-expression based statistical modeling
This paper investigates helper threads that improve performance by prefetching data on behalf of an application’s main thread. The focus is data prefetch helper threads that lac...
Tor M. Aamodt, Paul Chow