Sciweavers

286 search results - page 22 / 58
» Recognition Algorithm for Diamond-Free Graphs
Sort
View
MOBIHOC
2009
ACM
16 years 2 months ago
Fine-grained boundary recognition in wireless ad hoc and sensor networks by topological methods
Location-free boundary recognition is crucial and critical for many fundamental network functionalities in wireless ad hoc and sensor networks. Previous designs, often coarse-grai...
Dezun Dong, Yunhao Liu, Xiangke Liao
ICIP
2000
IEEE
16 years 3 months ago
Combined Dynamic Tracking and Recognition of Curves with Application to Road Detection
We present an algorithm that extracts the largest shape within a specificclass, starting from a set of image edgels. The algorithm inherits the Best-First Segmentation approach [jp...
Frederic Guichard, Jean-Philippe Tarel
IJCV
2006
115views more  IJCV 2006»
15 years 1 months ago
Object Recognition as Many-to-Many Feature Matching
Object recognition can be formulated as matching image features to model features. When recognition is exemplar-based, feature correspondence is one-to-one. However, segmentation e...
M. Fatih Demirci, Ali Shokoufandeh, Yakov Keselman...
GECCO
2006
Springer
154views Optimization» more  GECCO 2006»
15 years 5 months ago
Spectral techniques for graph bisection in genetic algorithms
Various applications of spectral techniques for enhancing graph bisection in genetic algorithms are investigated. Several enhancements to a genetic algorithm for graph bisection a...
Jacob G. Martin
SIGMOD
2008
ACM
144views Database» more  SIGMOD 2008»
16 years 2 months ago
Mining significant graph patterns by leap search
With ever-increasing amounts of graph data from disparate sources, there has been a strong need for exploiting significant graph patterns with user-specified objective functions. ...
Xifeng Yan, Hong Cheng, Jiawei Han, Philip S. Yu