Sciweavers

909 search results - page 19 / 182
» Performance Evaluation of the VF Graph Matching Algorithm
Sort
View
WAW
2007
Springer
77views Algorithms» more  WAW 2007»
14 years 1 months ago
Using Bloom Filters to Speed Up HITS-Like Ranking Algorithms
Abstract. This paper describes a technique for reducing the querytime cost of HITS-like ranking algorithm. The basic idea is to compute for each node in the web graph a summary of ...
Sreenivas Gollapudi, Marc Najork, Rina Panigrahy
ICCV
2001
IEEE
14 years 9 months ago
Performance Evaluation of Stereo for Tele-presence
In an immersive tele-presence environment a 3D remote real scene is projected from the viewpoint of the local user. This 3D world is acquired through stereo reconstruction at the ...
Jane Mulligan, Volkan Isler, Konstantinos Daniilid...
ITIIS
2010
190views more  ITIIS 2010»
13 years 2 months ago
An Efficient String Matching Algorithm Using Bidirectional and Parallel Processing Structure for Intrusion Detection System
Rapid growth of internet applications has increased the importance of intrusion detection system (IDS) performance. String matching is the most computation-consuming task in IDS. ...
Gwo-Ching Chang, Yue-Der Lin
SC
2009
ACM
14 years 2 months ago
Evaluating use of data flow systems for large graph analysis
Large graph analysis has become increasingly important and is widely used in many applications such as web mining, social network analysis, biology, and information retrieval. The...
Andy Yoo, Ian Kaplan
JAL
2006
101views more  JAL 2006»
13 years 7 months ago
Semi-matchings for bipartite graphs and load balancing
We consider the problem of fairly matching the left-hand vertices of a bipartite graph to the right-hand vertices. We refer to this problem as the optimal semimatching problem; it...
Nicholas J. A. Harvey, Richard E. Ladner, Lá...