Sciweavers

2485 search results - page 77 / 497
» Time Bounded Frequency Computations
Sort
View
SPAA
2009
ACM
15 years 9 months ago
Brief announcement: a lower bound for depth-restricted work stealing
Work stealing is a common technique used in the runtime schedulers of parallel languages such as Cilk and parallel libraries such as Intel Threading Building Blocks (TBB). Depth-r...
Jim Sukha
SIGMETRICS
2008
ACM
142views Hardware» more  SIGMETRICS 2008»
15 years 4 months ago
Exploiting manufacturing variations for compensating environment-induced clock drift in time synchronization
Time synchronization is an essential service in distributed computing and control systems. It is used to enable tasks such as synchronized data sampling and accurate time-offlight...
Thomas Schmid, Zainul Charbiwala, Jonathan Friedma...
INFOCOM
2000
IEEE
15 years 9 months ago
Near Optimal Routing Lookups with Bounded Worst Case Performance
Abstract—The problem of route address lookup has received much attention recently and several algorithms and data structures for performing address lookups at high speeds have be...
Pankaj Gupta, Balaji Prabhakar, Stephen P. Boyd
SDM
2012
SIAM
285views Data Mining» more  SDM 2012»
13 years 6 months ago
A Novel Approximation to Dynamic Time Warping allows Anytime Clustering of Massive Time Series Datasets
Given the ubiquity of time series data, the data mining community has spent significant time investigating the best time series similarity measure to use for various tasks and dom...
Qiang Zhu 0002, Gustavo E. A. P. A. Batista, Thana...
SPAA
2005
ACM
15 years 10 months ago
Name independent routing for growth bounded networks
A weighted undirected network is ∆ growth-bounded if the number of nodes at distance 2r around any given node is at most ∆ times the number of nodes at distance r around the n...
Ittai Abraham, Dahlia Malkhi