Sciweavers

1632 search results - page 122 / 327
» Sublinear Time Algorithms for Metric Space Problems
Sort
View
IPCCC
2006
IEEE
15 years 9 months ago
SHARP: a new real-time scheduling algorithm to improve security of parallel applications on heterogeneous clusters
This paper addresses the problem of improving quality of security for real-time parallel applications on heterogeneous clusters. We propose a new security- and heterogeneity-drive...
Tao Xie 0004, Xiao Qin, Mais Nijim
140
Voted
WCNC
2010
IEEE
15 years 7 months ago
A Novel Stability Weighted Clustering Algorithm for Multi-Hop Packet Radio Virtual Cellular Network
—Cooperative communications exploit the spatial diversity inherent in multiuser system by allowing cooperation among users having a wide range of channel qualities. How to search...
Qiyue Yu, Na Zhang, Weixiao Meng, Fumiyuki Adachi
164
Voted
IPPS
1996
IEEE
15 years 8 months ago
The Chessboard Distance Transform and the Medial Axis Transform are Interchangeable
The distance transform (DT) and the medial axis transform (MAT) are two image computation tools used to extract the information about the shape and the position of the foreground ...
Yu-Hua Lee, Shi-Jinn Horng
STOC
2012
ACM
217views Algorithms» more  STOC 2012»
13 years 6 months ago
Tight lower bounds for the online labeling problem
We consider the file maintenance problem (also called the online labeling problem) in which n integer items from the set {1, . . . , r} are to be stored in an array of size m ≥...
Jan Bulánek, Michal Koucký, Michael ...
157
Voted
SIGMETRICS
2008
ACM
116views Hardware» more  SIGMETRICS 2008»
15 years 3 months ago
Optimal sampling in state space models with applications to network monitoring
Advances in networking technology have enabled network engineers to use sampled data from routers to estimate network flow volumes and track them over time. However, low sampling ...
Harsh Singhal, George Michailidis