1190 search results - page 202 / 238 » On the Structure of Syntenic Distance |
ISMIS
1997
Springer
14 years 29 days ago
1997
Springer
e about image features can be expressed as a hierarchical structure called a Type Abstraction Hierarchy (TAH). TAHs can be generated automatically by clustering algorithms based on...
ADC
2007
Springer
14 years 25 days ago
2007
Springer
With the explosion of video data, video processing technologies have advanced quickly and been applied into many fields, such as advertisements, medical etc.. To fast search these...
FCT
2009
Springer
14 years 21 days ago
2009
Springer
We show that the reachability problem for directed graphs that are either K3,3-free or K5-free is in unambiguous log-space, UL coUL. This significantly extends the result of Bour...
CPAIOR
2004
Springer
14 years 17 days ago
2004
Springer
The graph isomorphism problem consists in deciding if two given graphs have an identical structure. This problem can be modeled as a constraint satisfaction problem in a very strai...
CSB
2004
IEEE
14 years 17 days ago
2004
IEEE
Feature selection and weighting are central problems in pattern recognition and instance-based learning. In this work, we discuss the challenges of constructing and weighting feat...