153 search results - page 17 / 31 » Uniformity Testing Using Minimal Spanning Tree |
111
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
We introduce a problem that is a common generalization of the uncapacitated facility location (UFL) and minimum latency (ML) problems, where facilities not only need to be opened ...
GECCO
2006
Springer
15 years 3 months ago
2006
Springer
Wire routing in a VLSI chip often requires minimization of wire-length as well as the number of intersections among multiple nets. Such an optimization problem is computationally ...
101
click to vote
EURODAC
1994
IEEE
15 years 3 months ago
1994
IEEE
In performance-driven interconnect design, delay estimators are used to determine both the topology and the layout of good routing trees. We address the class of moment-matching, ...
118
click to vote
COMGEO
2000
ACM
14 years 11 months ago
2000
ACM
We present a fast and accurate collision detection algorithm for haptic interaction with polygonal models. Given a model, we pre-compute a hybrid hierarchical representation, cons...
ICESS
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. We consider broadcast protocols in wireless networks that have limited energy and computation resources. The well-known algorithm, DBIP (Directional Broadcast Incremental...