Sciweavers

2127 search results - page 386 / 426
» Computing large matchings fast
Sort
View
138
Voted
TOG
2008
197views more  TOG 2008»
15 years 3 months ago
Two-way coupling of fluids to rigid and deformable solids and shells
We propose a novel solid/fluid coupling method that treats the coupled system in a fully implicit manner making it stable for arbitrary time steps, large density ratios, etc. In c...
Avi Robinson-Mosher, Tamar Shinar, Jon Gretarsson,...
155
Voted
GIS
2010
ACM
15 years 1 months ago
Natural neighbor interpolation based grid DEM construction using a GPU
With modern LiDAR technology the amount of topographic data, in the form of massive point clouds, has increased dramatically. One of the most fundamental GIS tasks is to construct...
Alex Beutel, Thomas Mølhave, Pankaj K. Agar...
142
Voted
IPPS
2008
IEEE
15 years 10 months ago
A modeling approach for estimating execution time of long-running scientific applications
In a Grid computing environment, resources are shared among a large number of applications. Brokers and schedulers find matching resources and schedule the execution of the applic...
Seyed Masoud Sadjadi, Shu Shimizu, Javier Figueroa...
119
Voted
HLPPP
1991
15 years 7 months ago
The Chemical Reaction Model
Gamma was originally proposed in 1986 as a formalism for the de nition of programs without arti cial sequentiality. The basic idea underlying the formalism is to describe computati...
Daniel Le Métayer
146
Voted
IANDC
2008
141views more  IANDC 2008»
15 years 3 months ago
Graph connectivity, partial words, and a theorem of Fine and Wilf
The problem of computing periods in words, or finite sequences of symbols from a finite alphabet, has important applications in several areas including data compression, string se...
Francine Blanchet-Sadri, Deepak Bal, Gautam Sisodi...