Sciweavers

4137 search results - page 319 / 828
» On the number of matchings of a tree
Sort
View
INFOCOM
2000
IEEE
15 years 11 months ago
The Throughput of Data Switches with and without Speedup
— In this paper we use fluid model techniques to establish two results concerning the throughput of data switches. For an input-queued switch (with no speedup) we show that a ma...
J. G. Dai, Balaji Prabhakar
ICPR
2006
IEEE
16 years 8 months ago
Compound Stochastic Models For Fingerprint Individuality
The question of fingerprint individuality can be posed as follows: Given a query fingerprint, what is the probability that the observed number of minutiae matches with a template ...
Anil K. Jain, Sarat C. Dass, Yongfang Zhu
RECOMB
2004
Springer
16 years 7 months ago
Structured motifs search
In this paper we describe an algorithm for the localization of structured models, i.e. sequences of (simple) motifs and distance constraints. It basically combines standard patter...
Alberto Policriti, Nicola Vitacolonna, Michele Mor...
ICPR
2008
IEEE
16 years 1 months ago
Ranking the local invariant features for the robust visual saliencies
Local invariant feature based methods have been proven to be effective in computer vision for object recognition and learning. But for an image, the number of points detected and ...
Shengping Xia, Peng Ren, Edwin R. Hancock
SEMWEB
2007
Springer
16 years 28 days ago
Falcon-AO: Results for OAEI 2007
In this paper, we present a brief overview of Falcon-AO (version 0.7): a practical ontology matching system with acceptable to very good performance, a flexible architecture, and ...
Wei Hu, Yuanyuan Zhao, Dan Li, Gong Cheng, Honghan...