Sciweavers

166 search results - page 25 / 34
» Partitioning Graphs to Speed Up Dijkstra's Algorithm
Sort
View
VLSID
2002
IEEE
136views VLSI» more  VLSID 2002»
14 years 8 months ago
Buffered Routing Tree Construction under Buffer Placement Blockages
Interconnect delay has become a critical factor in determining the performance of integrated circuits. Routing and buffering are powerful means of improving the circuit speed and ...
Wei Chen, Massoud Pedram, Premal Buch
SODA
2008
ACM
96views Algorithms» more  SODA 2008»
13 years 9 months ago
Greedy drawings of triangulations
Greedy Routing is a class of routing algorithms in which the packets are forwarded in a manner that reduces the distance to the destination at every step. In an attempt to provide...
Raghavan Dhandapani
ICDE
2002
IEEE
106views Database» more  ICDE 2002»
14 years 9 months ago
OSSM: A Segmentation Approach to Optimize Frequency Counting
Computing the frequency of a pattern is one of the key operations in data mining algorithms. We describe a simple yet powerful way of speeding up any form of frequency counting sa...
Carson Kai-Sang Leung, Raymond T. Ng, Heikki Manni...
WWW
2003
ACM
14 years 8 months ago
Extrapolation methods for accelerating PageRank computations
We present a novel algorithm for the fast computation of PageRank, a hyperlink-based estimate of the "importance" of Web pages. The original PageRank algorithm uses the ...
Sepandar D. Kamvar, Taher H. Haveliwala, Christoph...
WWW
2005
ACM
14 years 8 months ago
Incremental page rank computation on evolving graphs
Link Analysis has been a popular and widely used Web mining technique, especially in the area of Web search. Various ranking schemes based on link analysis have been proposed, of ...
Prasanna Kumar Desikan, Nishith Pathak, Jaideep Sr...