Sciweavers

271 search results - page 34 / 55
» Quasi-isometries between graphs and trees
Sort
View
ICAPR
2009
Springer
14 years 7 days ago
Multisensor Biometric Evidence Fusion for Person Authentication Using Wavelet Decomposition and Monotonic-Decreasing Graph
—This paper presents a novel biometric sensor generated evidence fusion of face and palmprint images using wavelet decomposition for personnel identity verification. The approach...
Dakshina Ranjan Kisku, Jamuna Kanta Sing, Massimo ...
MP
1998
117views more  MP 1998»
13 years 7 months ago
The node capacitated graph partitioning problem: A computational study
In this paper we consider the problem of ^-partitioning the nodes of a graph with capacity restrictions on the sum of the node weights in each subset of the partition, and the obje...
Carlos Eduardo Ferreira, Alexander Martin, C. Carv...
IPPS
2007
IEEE
14 years 1 months ago
Average Execution Time Analysis of a Self-stabilizing Leader Election Algorithm
This paper deals with the self-stabilizing leader election algorithm of Xu and Srimani [10] that finds a leader in a tree graph. The worst case execution time for this algorithm ...
Juan Paulo Alvarado-Magaña, José Alb...
IPPS
2003
IEEE
14 years 28 days ago
An Extended Link Reversal Protocol in Dynamic Networks
— We consider the problem of maintaining routing paths between nodes in a dynamic network. Gafni and Bertsekas proposed a link reversal approach called the BG method that maintai...
Jie Wu, Fei Dai
BIBM
2008
IEEE
106views Bioinformatics» more  BIBM 2008»
13 years 9 months ago
Uncovering Genomic Reassortments among Influenza Strains by Enumerating Maximal Bicliques
The evolutionary histories of viral genomes have received significant recent attention due to their importance in understanding virulence and the corresponding ramifications to pu...
Niranjan Nagarajan, Carl Kingsford