3600 search results - page 615 / 720 » The settling-time reducibility ordering |
280
click to vote
CC
2009
Springer
16 years 7 months ago
2009
Springer
Speculative parallelisation represents a promising solution to speed up sequential programs that are hard to parallelise otherwise. Prior research has focused mainly on parallelisi...
164
click to vote
CHI
2009
ACM
16 years 7 months ago
2009
ACM
Kazuhiro Terajima The University of Tokyo 7-3-1 Hongo, Bunkyo-ku, Tokyo, 113-8656 Japan Kazuhiro_Terajima@ipc.i.u-tokyo.ac.jp Takashi Komuro The University of Tokyo 7-3-1 Hongo, Bu...
173
click to vote
KDD
2009
ACM
16 years 7 months ago
2009
ACM
In recent years, the blogosphere has experienced a substantial increase in the number of posts published daily, forcing users to cope with information overload. The task of guidin...
158
click to vote
MOBIHOC
2009
ACM
16 years 7 months ago
2009
ACM
Routing is one of the most challenging open problems in disruption-tolerant networks (DTNs) because of the shortlived wireless connectivity environment. To deal with this issue, r...
181
click to vote
KDD
2008
ACM
16 years 6 months ago
2008
ACM
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...