Sciweavers

314 search results - page 40 / 63
» connection 1998
Sort
View
CVPR
1998
IEEE
14 years 10 months ago
Segmentation by Grouping Junctions
We propose a methodfor segmenting gray-value images. By segmentation, we mean a map from the set of pixels to a small set of levels such that each connected component of the set o...
Hiroshi Ishikawa 0002, Davi Geiger
ECCV
1998
Springer
14 years 10 months ago
Matching Hierarchical Structures Using Association Graphs
?It is well-known that the problem of matching two relational structures can be posed as an equivalent problem of finding a maximal clique in a (derived) ?association graph.? Howev...
Marcello Pelillo, Kaleem Siddiqi, Steven W. Zucker
IEEEARES
2006
IEEE
14 years 2 months ago
Identifying Intrusions in Computer Networks with Principal Component Analysis
Most current anomaly Intrusion Detection Systems (IDSs) detect computer network behavior as normal or abnormal but cannot identify the type of attacks. Moreover, most current intr...
Wei Wang, Roberto Battiti
COCO
2000
Springer
112views Algorithms» more  COCO 2000»
14 years 24 days ago
Combinatorial Interpretation of Kolmogorov Complexity
Kolmogorov’s very first paper on algorithmic information theory (Kolmogorov, Problemy peredachi infotmatsii 1(1) (1965), 3) was entitled “Three approaches to the definition ...
Andrei E. Romashchenko, Alexander Shen, Nikolai K....
CPM
1999
Springer
129views Combinatorics» more  CPM 1999»
14 years 22 days ago
On the Structure of Syntenic Distance
This paper examines some of the rich structure of the syntenic distance model of evolutionary distance, introduced by Ferretti et al. (1996). The syntenic distance between two gen...
David Liben-Nowell