1326 search results - page 204 / 266 » Approximate Tree Kernels |
163
click to vote
ISPD
1997
ACM
15 years 7 months ago
1997
ACM
The wire sizing problem under inequality Elmore delay constraints is known to be posynomial, hence convex under an exponential variable-transformation. There are formal methods fo...
139
click to vote
ESA
2008
Springer
15 years 5 months ago
2008
Springer
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...
135
click to vote
EUROPAR
2008
Springer
15 years 5 months ago
2008
Springer
Chip multiprocessors designed for streaming applications such as Cell BE offer impressive peak performance but suffer from limited bandwidth to offchip main memory. As the number o...
129
click to vote
NETWORKING
2007
15 years 4 months ago
2007
Multicasting is one of the most important applications in Wireless Ad hoc Networks and the currently emerging Wireless Mesh Networks. In such networks, interference due to the shar...
103
click to vote
VMV
2003
15 years 4 months ago
2003
We present a novel framework for hierarchical collision detection that can be applied to virtually all bounding volume (BV) hierarchies. It allows an application to trade quality ...