Sciweavers

540 search results - page 32 / 108
» Competitive Routing over Time
Sort
View
ISPD
2009
ACM
141views Hardware» more  ISPD 2009»
14 years 3 months ago
A faster approximation scheme for timing driven minimum cost layer assignment
As VLSI technology moves to the 65nm node and beyond, interconnect delay greatly limits the circuit performance. As a critical component in interconnect synthesis, layer assignmen...
Shiyan Hu, Zhuo Li, Charles J. Alpert
PERCOM
2008
ACM
14 years 8 months ago
SGR: A Shared Generic Routing Support for Ad Hoc Ubiquitous Computing Environments
One of the most evident characteristics of an ad hoc ubiquitous computing environment is the dynamism of connections. Due to the mobility of nodes, paths between communicating pee...
Yangwoo Ko, Dongman Lee
PDPTA
2003
13 years 10 months ago
The Performance of Routing Algorithms under Bursty Traffic Loads
Routing algorithms are traditionally evaluated under Poisson-like traffic distributions. This type of traffic is smooth over large time intervals and has been shown not necessaril...
Jeonghee Shin, Timothy Mark Pinkston
TKDE
2008
158views more  TKDE 2008»
13 years 9 months ago
Hierarchical Clustering of Time-Series Data Streams
This paper presents a time series whole clustering system that incrementally constructs a tree-like hierarchy of clusters, using a top-down strategy. The Online Divisive-Agglomera...
Pedro Pereira Rodrigues, João Gama, Jo&atil...
ICASSP
2010
IEEE
13 years 9 months ago
Partial sequence matching using an Unbounded Dynamic Time Warping algorithm
Before the advent of Hidden Markov Models(HMM)-based speech recognition, many speech applications were built using pattern matching algorithms like the Dynamic Time Warping (DTW) ...
Xavier Anguera, Robert Macrae, Nuria Oliver