Sciweavers

1421 search results - page 119 / 285
» Algorithms for subsequence combinatorics
Sort
View
CEC
2011
IEEE
14 years 4 months ago
Oppositional biogeography-based optimization for combinatorial problems
Abstract—In this paper, we propose a framework for employing opposition-based learning to assist evolutionary algorithms in solving discrete and combinatorial optimization proble...
Mehmet Ergezer, Dan Simon
TALG
2010
158views more  TALG 2010»
14 years 11 months ago
Clustering for metric and nonmetric distance measures
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...
Marcel R. Ackermann, Johannes Blömer, Christi...
IPPS
1999
IEEE
15 years 8 months ago
Parallel Biological Sequence Comparison Using Prefix Computations
We present practical parallel algorithms using prefix computations for various problems that arise in pairwise comparison of biological sequences. We consider both constant and af...
Srinivas Aluru, Natsuhiko Futamura, Kishan Mehrotr...
ICCAD
2003
IEEE
141views Hardware» more  ICCAD 2003»
15 years 9 months ago
An Enhanced Multilevel Algorithm for Circuit Placement
This paper presents several important enhancements to the recently published multilevel placement package mPL [12]. The improvements include (i) unconstrained quadratic relaxation...
Tony F. Chan, Jason Cong, Tim Kong, Joseph R. Shin...
ECCV
2006
Springer
16 years 6 months ago
Super-Resolution of 3D Face
Abstract. Super-resolution is a technique to restore the detailed information from the degenerated data. Lots of previous work is for 2D images while super-resolution of 3D models ...
Gang Pan, Shi Han, Zhaohui Wu, Yueming Wang