Sciweavers

728 search results - page 101 / 146
» Efficient Searching with Linear Constraints
Sort
View
SIGMOD
2003
ACM
88views Database» more  SIGMOD 2003»
16 years 6 months ago
Mapping Data in Peer-to-Peer Systems: Semantics and Algorithmic Issues
We consider the problem of mapping data in peer-topeer data-sharing systems. Such systems often rely on the use of mapping tables listing pairs of corresponding values to search f...
Anastasios Kementsietsidis, Marcelo Arenas, Ren&ea...
GECCO
2006
Springer
152views Optimization» more  GECCO 2006»
15 years 9 months ago
A combinatorial genetic algorithm for the configuration of the 2dF/AAOmega spectrograph at the anglo-Australian observatory
To help unravel the structure of the universe, astronomers have developed systems which observe large clusters of objects at the same time. One such system is the 2-degree field s...
Steven Manos, Geraint Lewis
ICML
2009
IEEE
16 years 6 months ago
SimpleNPKL: simple non-parametric kernel learning
Previous studies of Non-Parametric Kernel (NPK) learning usually reduce to solving some Semi-Definite Programming (SDP) problem by a standard SDP solver. However, time complexity ...
Jinfeng Zhuang, Ivor W. Tsang, Steven C. H. Hoi
CVPR
2006
IEEE
16 years 8 months ago
A Design Principle for Coarse-to-Fine Classification
Coarse-to-fine classification is an efficient way of organizing object recognition in order to accommodate a large number of possible hypotheses and to systematically exploit shar...
Sachin Gangaputra, Donald Geman
GECCO
2010
Springer
218views Optimization» more  GECCO 2010»
15 years 10 months ago
Cartesian genetic programming
This paper presents a new form of Genetic Programming called Cartesian Genetic Programming in which a program is represented as an indexed graph. The graph is encoded in the form o...
Julian Francis Miller, Simon L. Harding