Sciweavers

110 search results - page 5 / 22
» Fast Implementation of the Ultimate Opening
Sort
View
MM
2010
ACM
238views Multimedia» more  MM 2010»
13 years 9 months ago
Vlfeat: an open and portable library of computer vision algorithms
VLFeat is an open and portable library of computer vision algorithms. It aims at facilitating fast prototyping and reproducible research for computer vision scientists and student...
Andrea Vedaldi, Brian Fulkerson
JCPHY
2011
192views more  JCPHY 2011»
13 years 16 days ago
Fast analysis of molecular dynamics trajectories with graphics processing units - Radial distribution function histogramming
The calculation of radial distribution functions (RDFs) from molecular dynamics trajectory data is a common and computationally expensive analysis task. The rate limiting step in ...
Benjamin G. Levine, John E. Stone, Axel Kohlmeyer
ISSAC
2007
Springer
107views Mathematics» more  ISSAC 2007»
14 years 3 months ago
A disk-based parallel implementation for direct condensation of large permutation modules
Through the use of a new disk-based method for enumerating very large orbits, condensation for orbits with tens of billions of elements can be performed. The algorithm is novel in...
Eric Robinson, Jürgen Müller 0004, Gene ...
DEXAW
2003
IEEE
164views Database» more  DEXAW 2003»
14 years 2 months ago
Towards an Open Service Architecture for Data Mining on the Grid
Across a wide variety of fields, huge datasets are being collected and accumulated at a dramatical pace. The datasets addressed by individual applications are very often heteroge...
Peter Brezany, Jürgen Hofer, Alexander Wö...
IEEEPACT
2007
IEEE
14 years 4 months ago
Fast Track: Supporting Unsafe Optimizations with Software Speculation
The use of multi-core, multi-processor machines is opening new opportunities for software speculation, where program code is speculatively executed to improve performance at the a...
Kirk Kelsey, Chengliang Zhang, Chen Ding