400 search results - page 73 / 80 » Parallel Algorithms with Optimal Speedup for Bounded Treewid... |
71
Voted
STOC
2001
ACM
15 years 9 months ago
2001
ACM
Recently Rothemund and Winfree 6] have considered the program size complexity of constructing squares by selfassembly. Here, we consider the time complexity of such constructions ...
ICS
2009
Tsinghua U.
15 years 2 months ago
2009
Tsinghua U.
Modern GPUs offer much computing power at a very modest cost. Even though CUDA and other related recent developments are accelerating the use of GPUs for general purpose applicati...
103
click to vote
LCTRTS
2005
Springer
15 years 2 months ago
2005
Springer
Software pipelining is a critical optimization for producing efficient code for VLIW/EPIC and superscalar processors in highperformance embedded applications such as digital sign...
113
click to vote
PODC
2006
ACM
15 years 3 months ago
2006
ACM
We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...
ICDCS
2008
IEEE
15 years 3 months ago
2008
IEEE
Wireless sensor networks (WSNs) deployed for missioncritical applications face the fundamental challenge of meeting stringent spatiotemporal performance requirements using nodes w...