Sciweavers

822 search results - page 15 / 165
» Objective improvement in information-geometric optimization
Sort
View
CVPR
2007
IEEE
15 years 11 months ago
Optimizing Distribution-based Matching by Random Subsampling
We boost the efficiency and robustness of distributionbased matching by random subsampling which results in the minimum number of samples required to achieve a specified probabili...
Alex Po Leung, Shaogang Gong
ICALP
2009
Springer
15 years 10 months ago
Improved Bounds for Flow Shop Scheduling
We resolve an open question raised by Feige & Scheideler by showing that the best known approximation algorithm for flow shops is essentially tight with respect to the used low...
Monaldo Mastrolilli, Ola Svensson
GECCO
2006
Springer
210views Optimization» more  GECCO 2006»
15 years 1 months ago
Clustering the heap in multi-threaded applications for improved garbage collection
Garbage collection can be a performance bottleneck in large distributed, multi-threaded applications. Applications may produce millions of objects during their lifetimes and may i...
Myra B. Cohen, Shiu Beng Kooi, Witawas Srisa-an
AAAI
1996
14 years 11 months ago
A Hybrid Learning Approach for Better Recognition of Visual Objects
Real world images often contain similar objects but with different rotations, noise, or other visual alterations. Vision systems should be able to recognize objects regardless of ...
Ibrahim F. Imam, Srinivas Gutta
VEE
2010
ACM
218views Virtualization» more  VEE 2010»
15 years 4 months ago
Improving compiler-runtime separation with XIR
Intense research on virtual machines has highlighted the need for flexible software architectures that allow quick evaluation of new design and implementation techniques. The inte...
Ben Titzer, Thomas Würthinger, Doug Simon, Ma...