Sciweavers

2714 search results - page 318 / 543
» Approximation Schemes for Scheduling
Sort
View
ICALP
2004
Springer
15 years 9 months ago
The Black-Box Complexity of Nearest Neighbor Search
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
Robert Krauthgamer, James R. Lee
147
Voted
ISBI
2004
IEEE
16 years 4 months ago
Cardiac MR Image Segmentation: Quality Assessment of STACS
We present an energy based automatic image segmentation algorithm that uses a novel active contour scheme, called the stochastic active contour scheme (STACS). The algorithm overc...
Charnchai Pluempitiwiriyawej, Chien Ho, José...
INFOCOM
2009
IEEE
15 years 10 months ago
Power-Aware Speed Scaling in Processor Sharing Systems
—Energy use of computer communication systems has quickly become a vital design consideration. One effective method for reducing energy consumption is dynamic speed scaling, whic...
Adam Wierman, Lachlan L. H. Andrew, Ao Tang
107
Voted
CLUSTER
2008
IEEE
15 years 10 months ago
Message progression in parallel computing - to thread or not to thread?
Abstract—Message progression schemes that enable communication and computation to be overlapped have the potential to improve the performance of parallel applications. With curre...
Torsten Hoefler, Andrew Lumsdaine
125
Voted
SECON
2008
IEEE
15 years 10 months ago
Per User Throughput in Large Wireless Networks
— Previous results show that a node’s throughput scales poorly as the network size increases when every node has traffic. However, in many cases, only a fraction of nodes in l...
Dan Xu, Xin Liu