Sciweavers

248 search results - page 27 / 50
» The Relative Complexity of NP Search Problems
Sort
View
DEXA
2007
Springer
150views Database» more  DEXA 2007»
14 years 1 months ago
Sequence Alignment as a Database Technology Challenge
Abstract. Sequence alignment is an important task for molecular biologists. Because alignment basically deals with approximate string matching on large biological sequence collecti...
Hans Philippi
CIKM
2009
Springer
14 years 2 months ago
Mining linguistic cues for query expansion: applications to drug interaction search
Given a drug under development, what are other drugs or biochemical compounds that it might interact with? Early answers to this question, by mining the literature, are valuable f...
Sheng Guo, Naren Ramakrishnan
ICIP
2000
IEEE
14 years 8 months ago
Combined Dynamic Tracking and Recognition of Curves with Application to Road Detection
We present an algorithm that extracts the largest shape within a specificclass, starting from a set of image edgels. The algorithm inherits the Best-First Segmentation approach [jp...
Frederic Guichard, Jean-Philippe Tarel
ICTAI
2002
IEEE
14 years 19 days ago
Calculus of Variations in Discrete Space for Constrained Nonlinear Dynamic Optimization
In this paper, we propose new dominance relations that can speed up significantly the solution process of nonlinear constrained dynamic optimization problems in discrete time and...
Yixin Chen, Benjamin W. Wah
GECCO
2010
Springer
127views Optimization» more  GECCO 2010»
13 years 6 months ago
Set-based multi-objective optimization, indicators, and deteriorative cycles
Evolutionary multi-objective optimization deals with the task of computing a minimal set of search points according to a given set of objective functions. The task has been made e...
Rudolf Berghammer, Tobias Friedrich, Frank Neumann