Sciweavers

759 search results - page 40 / 152
» Optimal Graph Search with Iterated Graph Cuts
Sort
View
CVPR
2008
IEEE
15 years 11 months ago
3D occlusion recovery using few cameras
We present a practical framework for detecting and modeling 3D static occlusions for wide-baseline, multi-camera scenarios where the number of cameras is small. The framework cons...
Mark A. Keck, James W. Davis
VLDB
2007
ACM
155views Database» more  VLDB 2007»
15 years 10 months ago
Towards Graph Containment Search and Indexing
Given a set of model graphs D and a query graph q, containment search aims to find all model graphs g D such that q contains g (q g). Due to the wide adoption of graph models, f...
Chen Chen, Xifeng Yan, Philip S. Yu, Jiawei Han, D...
GECCO
2004
Springer
123views Optimization» more  GECCO 2004»
15 years 3 months ago
A Hybrid Genetic Approach for Circuit Bipartitioning
We propose a hybrid genetic algorithm for partitioning a VLSI circuit graph into two disjoint graphs of minimum cut size. The algorithm includes a local optimization heuristic whic...
Jong-Pil Kim, Yong-Hyuk Kim, Byung Ro Moon
ESWS
2006
Springer
15 years 1 months ago
An Iterative Algorithm for Ontology Mapping Capable of Using Training Data
We present a new iterative algorithm for ontology mapping where we combine standard string distance metrics with a structural similarity measure that is based on a vector represent...
Andreas Heß
GECCO
2008
Springer
140views Optimization» more  GECCO 2008»
14 years 10 months ago
A bivariate probabilistic model-building genetic algorithm for graph bipartitioning
We investigate a bi-variate probabilistic model-building GA for the graph bipartitioning problem. The graph bipartitioning problem is a grouping problem that requires some modifi...
Dirk Thierens