Sciweavers

2555 search results - page 394 / 511
» Quantifiers and Working Memory
Sort
View
COMPGEOM
2006
ACM
15 years 10 months ago
Engineering a compact parallel delaunay algorithm in 3D
We describe an implementation of a compact parallel algorithm for 3D Delaunay tetrahedralization on a 64-processor shared-memory machine. Our algorithm uses a concurrent version o...
Daniel K. Blandford, Guy E. Blelloch, Clemens Kado...
PDC
2006
ACM
15 years 10 months ago
Make it so! Jean-Luc Picard, Bart Simpson and the design of e-public services
In this paper, we report on a project applying participatory design methods to include people who have experience of social exclusion (in one form or another) in designing possibl...
Andy Dearden, Angela Lauener, Frances Slack, Chris...
130
Voted
CVPR
2010
IEEE
15 years 9 months ago
Pushing the Envelope of Modern Methods for Bundle Adjustment
In this paper, we present results and experiments with several methods for bundle adjustment, producing the fastest bundle adjuster ever published. The fastest methods work with t...
Yekeun Jeong, David Nister, Drew Steedly, Richard ...
APCSAC
2005
IEEE
15 years 9 months ago
Irregular Redistribution Scheduling by Partitioning Messages
Abstract. Dynamic data redistribution enhances data locality and improves algorithm performance for numerous scientific problems on distributed memory multi-computers systems. Prev...
Chang Yu, Ching-Hsien Hsu, Kun-Ming Yu, Chiu-Kuo L...
109
Voted
CCGRID
2005
IEEE
15 years 9 months ago
Secret sequence comparison on public grid computing resources
Once a new gene has been sequenced, it must be verified whether or not it is similar to previously sequenced genes. In many cases, the organization that sequenced a potentially n...
Ken-ichi Kurata, Hiroshi Nakamura, Vincent Breton