Sciweavers

6437 search results - page 46 / 1288
» Parallel Algorithms for Arrangements
Sort
View
DAGSTUHL
2007
13 years 11 months ago
Parallelism through Digital Circuit Design
Abstract. Two ways to exploit chips with a very large number of transistors are multicore processors and programmable logic chips. Some data parallel algorithms can be executed eï¬...
John O'Donnell
PLDI
1993
ACM
14 years 2 months ago
Global Optimizations for Parallelism and Locality on Scalable Parallel Machines
Data locality is critical to achievinghigh performance on large-scale parallel machines. Non-local data accesses result in communication that can greatly impact performance. Thus ...
Jennifer-Ann M. Anderson, Monica S. Lam
COMPGEOM
2001
ACM
14 years 1 months ago
The convex hull of ellipsoids
The treatment of curved algebraic surfaces becomes more and more the focus of attention in Computational Geometry. We present a video that illustrates the computation of the conve...
Nicola Geismann, Michael Hemmer, Elmar Schöme...
DCG
2006
82views more  DCG 2006»
13 years 10 months ago
Volume Computation for Polytopes and Partition Functions for Classical Root Systems
This paper presents an algorithm to compute the value of the inverse Laplace transforms of rational functions with poles on arrangements of hyperplanes. As an application, we prese...
M. Welleda Baldoni-Silva, Matthias Beck, Charles C...
MOBICOM
2003
ACM
14 years 3 months ago
Topology control for wireless sensor networks
We consider a two-tiered Wireless Sensor Network (WSN) consisting of sensor clusters deployed around strategic locations and base-stations (BSs) whose locations are relatively fl...
Jianping Pan, Yiwei Thomas Hou, Lin Cai, Yi Shi, S...