6437 search results - page 580 / 1288 » Parallel Algorithms for Arrangements |
168
click to vote
PPSN
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. Three theoretical perspectives upon conservation of performance in function optimization are outlined. In terms of statistical information, performance is conserved when ...
218
click to vote
DAGSTUHL
2006
15 years 8 months ago
2006
Abstract. We propose a new adaptive algorithm for the exact simultaneous resolution of several triangular systems over finite fields: it is composed of several practicable variants...
172
click to vote
EGH
2009
Springer
15 years 4 months ago
2009
Springer
Stream compaction is a common parallel primitive used to remove unwanted elements in sparse data. This allows highly parallel algorithms to maintain performance over several proce...
198
click to vote
CCGRID
2007
IEEE
16 years 1 months ago
2007
IEEE
In the past, efficient parallel algorithms have always been developed specifically for the successive generations of parallel systems (vector machines, shared-memory machines, d...
167
click to vote
FOSSACS
2010
Springer
16 years 1 months ago
2010
Springer
For many application-level distributed protocols and parallel algorithms, the set of participants, the number of messages or the interaction structure are only known at run-time. T...