Sciweavers

6365 search results - page 257 / 1273
» Fast Local Computation Algorithms
Sort
View
ICPR
2002
IEEE
16 years 7 months ago
GraphGrep: A Fast and Universal Method for Querying Graphs
GraphGrep is an application-independent method for querying graphs, finding all the occurrences of a subgraph in a database of graphs. The interface to GraphGrep is a regular expr...
Rosalba Giugno, Dennis Shasha
EUROPAR
2007
Springer
15 years 10 months ago
Fast and Efficient Total Exchange on Two Clusters
Abstract. Total Exchange is one of the most important collective communication patterns for scientific applications. In this paper we propose an algorithm called LG for the total e...
Emmanuel Jeannot, Luiz Angelo Steffenel
CEC
2009
IEEE
16 years 1 months ago
Improved memetic algorithm for Capacitated Arc Routing Problem
— Capacitated Arc Routing Problem (CARP) has attracted much interest because of its wide applications in the real world. Recently, a memetic algorithm proposed by Lacomme et al. ...
Yi Mei, Ke Tang, Xin Yao
ICPR
2008
IEEE
16 years 1 months ago
Ridge Regression for Two Dimensional Locality Preserving Projection
Two Dimensional Locality Preserving Projection (2DLPP) is a recent extension of LPP, a popular face recognition algorithm. It has been shown that 2D-LPP performs better than PCA, ...
Nam Thanh Nguyen, Wanquan Liu, Svetha Venkatesh
IPPS
2007
IEEE
16 years 28 days ago
Fast Failure Detection in a Process Group
Failure detectors represent a very important building block in distributed applications. The speed and the accuracy of the failure detectors is critical to the performance of the ...
Xinjie Li, Monica Brockmeyer