Sciweavers

74 search results - page 11 / 15
» Combination Can Be Hard: Approximability of the Unique Cover...
Sort
View
GECCO
2008
Springer
145views Optimization» more  GECCO 2008»
13 years 8 months ago
Memory with memory: soft assignment in genetic programming
Based in part on observations about the incremental nature of most state changes in biological systems, we introduce the idea of Memory with Memory in Genetic Programming (GP), wh...
Nicholas Freitag McPhee, Riccardo Poli
MM
2010
ACM
200views Multimedia» more  MM 2010»
13 years 7 months ago
Multimodal location estimation
In this article we define a multimedia content analysis problem, which we call multimodal location estimation: Given a video/image/audio file, the task is to determine where it wa...
Gerald Friedland, Oriol Vinyals, Trevor Darrell
GIS
2005
ACM
14 years 8 months ago
Automatic extraction of road intersections from raster maps
Numerous raster maps are available on the Internet, but the geographic coordinates of the maps are often unknown. In order to determine the precise location of a raster map, we ex...
Yao-Yi Chiang, Craig A. Knoblock, Ching-Chien Chen
SIGIR
2010
ACM
13 years 7 months ago
Optimal meta search results clustering
By analogy with merging documents rankings, the outputs from multiple search results clustering algorithms can be combined into a single output. In this paper we study the feasibi...
Claudio Carpineto, Giovanni Romano
BMCBI
2007
216views more  BMCBI 2007»
13 years 7 months ago
A replica exchange Monte Carlo algorithm for protein folding in the HP model
Background: The ab initio protein folding problem consists of predicting protein tertiary structure from a given amino acid sequence by minimizing an energy function; it is one of...
Chris Thachuk, Alena Shmygelska, Holger H. Hoos