Sciweavers

7519 search results - page 123 / 1504
» Optimizing Generic Functions
Sort
View
CVPR
2012
IEEE
13 years 7 months ago
Graph cuts optimization for multi-limb human segmentation in depth maps
We present a generic framework for object segmentation using depth maps based on Random Forest and Graph-cuts theory, and apply it to the segmentation of human limbs in depth maps...
Antonio Hernández-Vela, Nadezhda Zlateva, A...
DLS
2010
204views Languages» more  DLS 2010»
15 years 3 months ago
Alias analysis for optimization of dynamic languages
Dynamic languages such as Python allow programs to be written more easily using high-level constructs such as comprehensions for queries and using generic code. Efficient executio...
Michael Gorbovitski, Yanhong A. Liu, Scott D. Stol...
FSE
1999
Springer
92views Cryptology» more  FSE 1999»
15 years 9 months ago
A New Characterization of Almost Bent Functions
We study the functions from Fm 2 into Fm 2 for odd m which oppose an optimal resistance to linear cryptanalysis. These functions are called almost bent. It is known that almost ben...
Anne Canteaut, Pascale Charpin, Hans Dobbertin
118
Voted
ICTAC
2005
Springer
15 years 10 months ago
Maximum Marking Problems with Accumulative Weight Functions
We present a new derivation of efficient algorithms for a class of optimization problems called maximum marking problems. We extend the class of weight functions used in the speciļ...
Isao Sasano, Mizuhito Ogawa, Zhenjiang Hu
GECCO
2009
Springer
147views Optimization» more  GECCO 2009»
15 years 9 months ago
Benchmarking the (1+1)-CMA-ES on the BBOB-2009 function testbed
The (1+1)-CMA-ES is an adaptive stochastic algorithm for the optimization of objective functions defined on a continuous search space in a black-box scenario. In this paper, an i...
Anne Auger, Nikolaus Hansen