Sciweavers

6365 search results - page 947 / 1273
» Fast Local Computation Algorithms
Sort
View
ICDCS
1996
IEEE
15 years 11 months ago
Dynamic Scheduling Strategies for Shared-memory Multiprocessors
Efficiently scheduling parallel tasks on to the processors of a shared-memory multiprocessor is critical to achieving high performance. Given perfect information at compile-time, ...
Babak Hamidzadeh, David J. Lilja
PODC
2010
ACM
15 years 10 months ago
Brief announcement: towards robust medium access in multi-hop networks
This paper introduces the distributed MAC protocol Jade. We consider a multi-hop wireless network with a single communication channel in which a powerful adversary is able to jam ...
Andréa W. Richa, Jin Zhang, Christian Schei...
ECCV
2006
Springer
15 years 10 months ago
SIFT and Shape Context for Feature-Based Nonlinear Registration of Thoracic CT Images
Nonlinear image registration is a prerequisite for various medical image analysis applications. Many data acquisition protocols suffer from problems due to breathing motion which h...
Martin Urschler, Joachim Bauer, Hendrik Ditt, Hors...
SIGMETRICS
2002
ACM
128views Hardware» more  SIGMETRICS 2002»
15 years 6 months ago
High-density model for server allocation and placement
It is well known that optimal server placement is NP-hard. We present an approximate model for the case when both clients and servers are dense, and propose a simple server alloca...
Craig W. Cameron, Steven H. Low, David X. Wei
ICASSP
2011
IEEE
14 years 10 months ago
Content preference estimation in online social networks: Message passing versus sparse reconstruction on graphs
We design two different strategies for computing the unknown content preferences in an online social network based on a small set of nodes in the corresponding social graph for wh...
Jacob Chakareski