Sciweavers

1614 search results - page 319 / 323
» A Customizable Implementation of RMI for High Performance Co...
Sort
View
PLDI
2010
ACM
14 years 3 days ago
Finding low-utility data structures
Many opportunities for easy, big-win, program optimizations are missed by compilers. This is especially true in highly layered Java applications. Often at the heart of these misse...
Guoqing Xu, Nick Mitchell, Matthew Arnold, Atanas ...
SC
2009
ACM
13 years 11 months ago
GPU based sparse grid technique for solving multidimensional options pricing PDEs
It has been shown that the sparse grid combination technique can be a practical tool to solve high dimensional PDEs arising in multidimensional option pricing problems in finance...
Abhijeet Gaikwad, Ioane Muni Toke
EDBT
2009
ACM
277views Database» more  EDBT 2009»
13 years 11 months ago
G-hash: towards fast kernel-based similarity search in large graph databases
Structured data including sets, sequences, trees and graphs, pose significant challenges to fundamental aspects of data management such as efficient storage, indexing, and simila...
Xiaohong Wang, Aaron M. Smalter, Jun Huan, Gerald ...
ITC
1998
IEEE
94views Hardware» more  ITC 1998»
13 years 11 months ago
A method of serial data jitter analysis using one-shot time interval measurements
A method for measuring inter-symbol interference, duty cycle distortion, random jitter and periodic jitter is described. The Blackman-Tukey method of signal analysis is used. This...
Jan B. Wilstrup
GECCO
2006
Springer
170views Optimization» more  GECCO 2006»
13 years 10 months ago
How an optimal observer can collapse the search space
Many metaheuristics have difficulty exploring their search space comprehensively. Exploration time and efficiency are highly dependent on the size and the ruggedness of the search...
Christophe Philemotte, Hugues Bersini