Sciweavers

1725 search results - page 218 / 345
» Relaxed genetic programming
Sort
View
JMLR
2012
13 years 14 days ago
Constrained 1-Spectral Clustering
An important form of prior information in clustering comes in form of cannot-link and must-link constraints. We present a generalization of the popular spectral clustering techniq...
Syama Sundar Rangapuram, Matthias Hein
PRL
2006
139views more  PRL 2006»
14 years 10 months ago
Evolving color constancy
Objects retain their color in spite of changes in the wavelength and energy composition of the light they reflect. This phenomenon is called color constancy and plays an important ...
Marc Ebner
CVPR
2007
IEEE
16 years 22 hour ago
Efficient MRF Deformation Model for Non-Rigid Image Matching
We propose a novel MRF-based model for deformable image matching (also known as registration). The deformation is described by a field of discrete variables, representing displace...
Alexander Shekhovtsov, Ivan Kovtun, Václav ...
SODA
2012
ACM
297views Algorithms» more  SODA 2012»
13 years 13 days ago
Constant factor approximation algorithm for the knapsack median problem
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...
Amit Kumar
CDC
2009
IEEE
124views Control Systems» more  CDC 2009»
15 years 2 months ago
Design of insulating devices for in vitro synthetic circuits
— This paper describes a synthetic in vitro genetic circuit programmed to work as an insulating device. This circuit is composed of nucleic acids, which can be designed to intera...
Elisa Franco, Domitilla Del Vecchio, Richard M. Mu...