Sciweavers

75 search results - page 13 / 15
» Fast Algorithm for Graph Isomorphism Testing
Sort
View
ECCV
2008
Springer
13 years 9 months ago
Multiple Instance Boost Using Graph Embedding Based Decision Stump for Pedestrian Detection
Pedestrian detection in still image should handle the large appearance and stance variations arising from the articulated structure, various clothing of human as well as viewpoints...
Junbiao Pang, Qingming Huang, Shuqiang Jiang
VLDB
2007
ACM
155views Database» more  VLDB 2007»
14 years 7 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...
ESA
2004
Springer
92views Algorithms» more  ESA 2004»
14 years 28 days ago
Finding Dominators in Practice
The computation of dominators in a flowgraph has applications in several areas, including program optimization, circuit testing, and theoretical biology. Lengauer and Tarjan [30]...
Loukas Georgiadis, Renato Fonseca F. Werneck, Robe...
ECOOP
1997
Springer
13 years 11 months ago
Near Optimal Hierarchical Encoding of Types
A type inclusion test is a procedure to decide whether two types are related by a given subtyping relationship. An efficient implementation of the type inclusion test plays an impo...
Andreas Krall, Jan Vitek, R. Nigel Horspool
GECCO
2007
Springer
241views Optimization» more  GECCO 2007»
14 years 1 months ago
Binary ant algorithm
When facing dynamic optimization problems the goal is no longer to find the extrema, but to track their progression through the space as closely as possible. Over these kind of ov...
Carlos Fernandes, Agostinho C. Rosa, Vitorino Ramo...