Sciweavers

3208 search results - page 532 / 642
» A Lower Bound for Primality
Sort
View
CCCG
1998
13 years 11 months ago
A modified longest side bisection triangulation
Fast and efficient exploration of large terrains in a virtual reality manner requires different levels of detail to speedup processing of terrain parts in background. Thus, the tr...
Christoph Stamm, Stephan Eidenbenz, Renato Pajarol...
IPCO
1998
99views Optimization» more  IPCO 1998»
13 years 11 months ago
Non-approximability Results for Scheduling Problems with Minsum Criteria
We provide several non-approximability results for deterministic scheduling problems whose objective is to minimize the total job completion time. Unless P = NP, none of the probl...
Han Hoogeveen, Petra Schuurman, Gerhard J. Woeging...
SIROCCO
2000
13 years 11 months ago
Cooperative computing with fragmentable and mergeable groups
ABSTRACT: This work considers the problem of performing a set of N tasks on a set of P cooperating message-passing processors (P N). The processors use a group communication servi...
Chryssis Georgiou, Alexander A. Shvartsman
SODA
2000
ACM
123views Algorithms» more  SODA 2000»
13 years 11 months ago
Communication complexity of document exchange
We address the problem of minimizing the communication involved in the exchange of similar documents. We consider two users, A and B, who hold documents x and y respectively. Neit...
Graham Cormode, Mike Paterson, Süleyman Cenk ...
IPCO
1996
121views Optimization» more  IPCO 1996»
13 years 11 months ago
Transitive Packing
This paper attempts to provide a better understanding of the facial structure of polyhedra previously investigated separately. It introduces the notion of transitive packing and th...
Rudolf Müller, Andreas S. Schulz