3758 search results - page 299 / 752 » A Complete Subsumption Algorithm |
176
click to vote
SSPR
2004
Springer
15 years 12 months ago
2004
Springer
We present a probabilistic graphical model for point set matching. By using a result about the redundancy of the pairwise distances in a point set, we represent the binary relation...
157
click to vote
SWAT
2004
Springer
15 years 12 months ago
2004
Springer
Consider a graph problem which is associated with a parameter, for example, that of finding a longest tour spanning k vertices. The following question is natural: Is there a smal...
155
Voted
ICDAR
2003
IEEE
15 years 12 months ago
2003
IEEE
This paper describes a complete system for reading typewritten lexicon words in noisy images - in this case museum index cards. The system is conceptually simple, and straightforw...
153
click to vote
ISCAS
2003
IEEE
15 years 12 months ago
2003
IEEE
— The authors present a number of complete cores which are specially tailored for the low power implementation of FIR filters executed using block processing. The paper reveals t...
154
click to vote
LCN
2003
IEEE
15 years 12 months ago
2003
IEEE
This paper compares and evaluates the multicast performance of two of the most widely deployed System-Area Networks (SANs), Dolphin’s Scalable Coherent Interface (SCI) and Myric...