3148 search results - page 341 / 630 » On the Dynamic Initialization of Parallel Computers |
134
click to vote
ICCV
2007
IEEE
15 years 9 months ago
2007
IEEE
The matching of planar shapes can be cast as a problem of finding the shortest path through a graph spanned by the two shapes, where the nodes of the graph encode the local simil...
108
Voted
AAAI
2000
15 years 4 months ago
2000
We present a novel algorithm for computing the optimal winning bids in a combinatorial auction (CA), that is, an auction in which bidders bid for bundles of goods. All previously ...
139
Voted
ICPP
2008
IEEE
15 years 10 months ago
2008
IEEE
This paper presents a two-part study on managing distributed NUCA (Non-Uniform Cache Architecture) L2 caches in a future manycore processor to obtain high singlethread program per...
121
click to vote
ICDCS
2007
IEEE
15 years 9 months ago
2007
IEEE
Both peer-to-peer and sensor networks have the fundamental characteristics of node churn and failures. Peers in P2P networks are highly dynamic, whereas sensors are not dependable...
144
Voted
ICPP
2006
IEEE
15 years 9 months ago
2006
IEEE
Publish/subscribe (pub/sub) systems are very suitable for the dissemination of dynamic information over the Internet. As dynamic information is usually characterized by a short li...