6437 search results - page 46 / 1288 » Parallel Algorithms for Arrangements |
100
click to vote
DAGSTUHL
2007
15 years 2 months ago
2007
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ï¬...
177
Voted
PLDI
1993
ACM
15 years 4 months ago
1993
ACM
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 ...
140
Voted
COMPGEOM
2001
ACM
15 years 4 months ago
2001
ACM
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...
85
Voted
DCG
2006
15 years 16 days ago
2006
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...
122
click to vote
MOBICOM
2003
ACM
15 years 5 months ago
2003
ACM
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...