Sciweavers

909 search results - page 124 / 182
» Performance Evaluation of the VF Graph Matching Algorithm
Sort
View
GECCO
2005
Springer
186views Optimization» more  GECCO 2005»
15 years 6 months ago
Subproblem optimization by gene correlation with singular value decomposition
Several ways of using singular value decomposition (SVD), a linear algebra technique typically used for information retrieval, to decompose problems into subproblems are investiga...
Jacob G. Martin
SIGCOMM
2004
ACM
15 years 6 months ago
Routing in a delay tolerant network
We formulate the delay-tolerant networking routing problem, where messages are to be moved end-to-end across a connectivity graph that is time-varying but whose dynamics may be kn...
Sushant Jain, Kevin R. Fall, Rabin K. Patra
AIRWEB
2007
Springer
15 years 5 months ago
Measuring Similarity to Detect Qualified Links
The early success of link-based ranking algorithms was predicated on the assumption that links imply merit of the target pages. However, today many links exist for purposes other ...
Xiaoguang Qi, Lan Nie, Brian D. Davison
INFORMATICALT
2000
197views more  INFORMATICALT 2000»
15 years 1 months ago
Fingerprint Pre-Classification Using Ridge Density
Fingerprint ridge frequency is a global feature, which is most prominently different in fingerprints of men and woman, and it also changes within the maturing period of a person. T...
Algimantas Malickas, Rimantas Vitkus
WWW
2007
ACM
16 years 2 months ago
GigaHash: scalable minimal perfect hashing for billions of urls
A minimal perfect function maps a static set of keys on to the range of integers {0,1,2, ... , - 1}. We present a scalable high performance algorithm based on random graphs for ...
Kumar Chellapilla, Anton Mityagin, Denis Xavier Ch...