Sciweavers

6315 search results - page 984 / 1263
» Approximating Solution Structure
Sort
View
EMMCVPR
2005
Springer
15 years 10 months ago
Probabilistic Subgraph Matching Based on Convex Relaxation
We present a novel approach to the matching of subgraphs for object recognition in computer vision. Feature similarities between object model and scene graph are complemented with ...
Christian Schellewald, Christoph Schnörr
FC
2005
Springer
87views Cryptology» more  FC 2005»
15 years 10 months ago
Protecting Secret Data from Insider Attacks
We consider defenses against confidentiality and integrity attacks on data following break-ins, or so-called intrusion resistant storage technologies. We investigate the problem o...
David Dagon, Wenke Lee, Richard J. Lipton
GECCO
2005
Springer
110views Optimization» more  GECCO 2005»
15 years 10 months ago
A genetic algorithm encoding for a class of cardinality constraints
A genetic algorithm encoding is proposed which is able to automatically satisfy a class of important cardinality constraints where the set of distinct values of the design variabl...
Helio J. C. Barbosa, Afonso C. C. Lemonge
VLDB
2005
ACM
140views Database» more  VLDB 2005»
15 years 10 months ago
Complex Spatio-Temporal Pattern Queries
This paper introduces a novel type of query, what we name Spatio-temporal Pattern Queries (STP). Such a query specifies a spatiotemporal pattern as a sequence of distinct spatial...
Marios Hadjieleftheriou, George Kollios, Petko Bak...
GECCO
2004
Springer
15 years 10 months ago
Selection-Insertion Schemes in Genetic Algorithms for the Flexible Ligand Docking Problem
Abstract. In this work we have implemented and analyzed the performance of a new real coded steady-state genetic algorithm (SSGA) for the flexible ligand-receptor docking problem....
Camila S. de Magalhães, Helio J. C. Barbosa...