Sciweavers

2485 search results - page 347 / 497
» Time Bounded Frequency Computations
Sort
View
IPPS
1999
IEEE
14 years 10 days ago
ParaPART: Parallel Mesh Partitioning Tool for Distributed Systems
In this paper, we present ParaPART, a parallel version of a mesh partitioning tool, called PART, for distributed systems. PART takes into consideration the heterogeneities in proce...
Jian Chen, Valerie E. Taylor
VVS
1996
IEEE
129views Visualization» more  VVS 1996»
14 years 6 days ago
Optimal Isosurface Extraction from Irregular Volume Data
A method is proposed which supports the extraction of isosurfaces from irregular volume data, represented by tetrahedral decomposition, in optimal time. The method is based on a d...
Paolo Cignoni, Claudio Montani, Enrico Puppo, Robe...
ISSAC
1997
Springer
157views Mathematics» more  ISSAC 1997»
14 years 6 days ago
On the Worst-case Complexity of Integer Gaussian Elimination
Gaussian elimination is the basis for classical algorithms for computing canonical forms of integer matrices. Experimental results have shown that integer Gaussian elimination may...
Xin Gui Fang, George Havas
SPAA
1990
ACM
14 years 2 days ago
Parallel Algorithms for Arrangements
We give the first efficient parallel algorithms for solving the arrangement problem. We give a deterministic algorithm for the CREW PRAM which runs in nearly optimal bounds of O(lo...
Richard J. Anderson, Paul Beame, Erik Brisson
WINE
2010
Springer
251views Economy» more  WINE 2010»
13 years 5 months ago
The Complexity of Equilibria in Cost Sharing Games
We study Congestion Games with non-increasing cost functions (Cost Sharing Games) from a complexity perspective and resolve their computational hardness, which has been an open que...
Vasilis Syrgkanis