1985 search results - page 112 / 397 » A Minimal Periods Algorithm with Applications |
133
Voted
ASPDAC
2005
ACM
15 years 5 months ago
2005
ACM
— Motivated by VLSI/ULSI routing applications, we present a heuristic for rectilinear Steiner minimal tree (RSMT) construction. We transform a rectilinear minimum spanning tree (...
230
Voted
ICDE
2006
IEEE
16 years 5 months ago
2006
IEEE
We introduce a new domain-independent framework for formulating and efficiently evaluating similarity queries over historical data, where given a history as a sequence of timestam...
139
click to vote
TPDS
2008
15 years 3 months ago
2008
Abstract-- With increasing richness in features such as personalization of content, web applications are becoming more complex and hence compute intensive. Traditional approaches t...
155
Voted
WWW
2003
ACM
16 years 4 months ago
2003
ACM
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 ...
133
click to vote
JSAC
2006
15 years 3 months ago
2006
We focus on detecting intrusions in ad hoc networks using the misuse detection technique. We allow for detection modules that periodically stop functioning due to operational failu...