Sciweavers

17760 search results - page 400 / 3552
» A Generalization of the Massey-Ding Algorithm
Sort
View
218
Voted
FSTTCS
2004
Springer
16 years 29 days ago
Improved Approximation Algorithms for Maximum Graph Partitioning Problems
Abstract Abstract. In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k...
Gerold Jäger, Anand Srivastav
203
Voted
GECCO
2004
Springer
16 years 29 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
ISPD
2003
ACM
103views Hardware» more  ISPD 2003»
16 years 25 days ago
An integrated floorplanning with an efficient buffer planning algorithm
Previous works on buffer planning are mainly based on fixed die placement. It is necessary to reduce the complexity of computing the feasible buffer insertion sites to integrate t...
Yuchun Ma, Xianlong Hong, Sheqin Dong, Song Chen, ...
MM
2003
ACM
143views Multimedia» more  MM 2003»
16 years 25 days ago
Approximate matching algorithms for music information retrieval using vocal input
Effective use of multimedia collections requires efficient and intuitive methods of searching and browsing. This work considers databases which store music and explores how these...
Richard L. Kline, Ephraim P. Glinert
234
Voted
PKDD
2009
Springer
184views Data Mining» more  PKDD 2009»
16 years 4 days ago
Boosting Active Learning to Optimality: A Tractable Monte-Carlo, Billiard-Based Algorithm
Abstract. This paper focuses on Active Learning with a limited number of queries; in application domains such as Numerical Engineering, the size of the training set might be limite...
Philippe Rolet, Michèle Sebag, Olivier Teyt...