286 search results - page 41 / 58 » Recognition Algorithm for Diamond-Free Graphs |
WG
2000
Springer
15 years 1 months ago
2000
Springer
: In a previous work, the authors introduced the class of graphs with bounded induced distance of order k, (BID(k) for short) to model non-reliable interconnection networks. A netw...
SCALESPACE
2005
Springer
15 years 3 months ago
2005
Springer
In previous work, singular points (or top points) in the scale space representation of generic images have proven valuable for image matching. In this paper, we propose a construct...
PSIVT
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. In a process of insect footprint recognition, footprint segments need to be extracted from scanned insect footprints in order to find out appropriate features for classi...
189
click to vote
ICDE
2008
IEEE
15 years 11 months ago
2008
IEEE
Linear Discriminant Analysis (LDA) has been a popular method for extracting features which preserve class separability. It has been widely used in many fields of information proces...
95
Voted
AIRWEB
2008
Springer
14 years 11 months ago
2008
Springer
We present an algorithm, witch, that learns to detect spam hosts or pages on the Web. Unlike most other approaches, it simultaneously exploits the structure of the Web graph as we...