Sciweavers

4926 search results - page 295 / 986
» Two Graph Algorithms On an Associative Computing Model
Sort
View
INFOCOM
1996
IEEE
15 years 9 months ago
Latency-Rate Servers: A General Model for Analysis of Traffic Scheduling Algorithms
In this paper, we develop a general model, called Latency-Rate servers (LR servers), for the analysis of traffic scheduling algorithms in broadband packet networks. The behavior of...
Dimitrios Stiliadis, Anujan Varma
ICIP
2003
IEEE
16 years 6 months ago
An integrated algorithm of incremental and robust PCA
Principal Component Analysis (PCA) is a well-established technique in image processing and pattern recognition. Incremental PCA and robust PCA are two interesting problems with nu...
Yongmin Li Li, Li-Qun Xu, Jason Morphett, Richard ...
BMCBI
2006
141views more  BMCBI 2006»
15 years 5 months ago
Maximum common subgraph: some upper bound and lower bound results
Background: Structure matching plays an important part in understanding the functional role of biological structures. Bioinformatics assists in this effort by reformulating this p...
Xiuzhen Huang, Jing Lai, Steven F. Jennings
ISAAC
2009
Springer
140views Algorithms» more  ISAAC 2009»
15 years 11 months ago
Shifting Strategy for Geometric Graphs without Geometry
We give a simple framework which is an alternative to the celebrated and widely used shifting strategy of Hochbaum and Maass [J. ACM, 1985] which has yielded efficient algorithms ...
Imran A. Pirwani
SAC
2008
ACM
15 years 4 months ago
Privacy-preserving link discovery
Abstract. Link discovery is a process of identifying association(s) among different entities included in a complex network structure. These association(s) may represent any interac...
Xiaoyun He, Basit Shafiq, Jaideep Vaidya, Nabil R....