Sciweavers

2822 search results - page 299 / 565
» Global Optimization of Histograms
Sort
View
LPAR
2005
Springer
16 years 4 days ago
Another Complete Local Search Method for SAT
Local search algorithms are one of the effective methods for solving hard combinatorial problems. However, a serious problem of this approach is that the search often traps at loca...
Haiou Shen, Hantao Zhang
GECCO
2004
Springer
16 years 1 days ago
The Lens Design Using the CMA-ES Algorithm
This paper presents a lens system design algorithm using the covariance matrix adaptation evolution strategy (CMA-ES), which is one of the most powerful self-adaptation mechanisms....
Yuichi Nagata
AAAI
2006
15 years 8 months ago
Efficient L1 Regularized Logistic Regression
L1 regularized logistic regression is now a workhorse of machine learning: it is widely used for many classification problems, particularly ones with many features. L1 regularized...
Su-In Lee, Honglak Lee, Pieter Abbeel, Andrew Y. N...
TPDS
2008
88views more  TPDS 2008»
15 years 6 months ago
A Two-Hop Solution to Solving Topology Mismatch
The efficiency of Peer-to-Peer (P2P) systems is largely dependent on the overlay constructions. Due to the random selection of logical neighbors, there often exists serious topolog...
Yunhao Liu
ACCV
2010
Springer
15 years 1 months ago
A Convex Image Segmentation: Extending Graph Cuts and Closed-Form Matting
Abstract. Image matting and segmentation are two closely related topics that concern extracting the foreground and background of an image. While the methods based on global optimiz...
Youngjin Park, Suk I. Yoo