Sciweavers

2020 search results - page 32 / 404
» Speeding up Slicing
Sort
View
AOR
2010
13 years 5 months ago
Speeding up Stochastic Dynamic Programming with Zero-Delay Convolution
We show how a technique from signal processing known as zero-delay convolution can be used to develop more efficient dynamic programming algorithms for a broad class of stochastic...
Brian C. Dean
CORR
2011
Springer
175views Education» more  CORR 2011»
13 years 2 months ago
A Novel Probabilistic Pruning Approach to Speed Up Similarity Queries in Uncertain Databases
Abstract— In this paper, we propose a novel, effective and efficient probabilistic pruning criterion for probabilistic similarity queries on uncertain data. Our approach support...
Thomas Bernecker, Tobias Emrich, Hans-Peter Kriege...
CORR
2011
Springer
152views Education» more  CORR 2011»
13 years 2 months ago
To Parallelize or Not to Parallelize, Speed Up Issue
Alaa Ismail Elnashar
MP
2010
163views more  MP 2010»
13 years 2 months ago
Speeding up IP-based algorithms for constrained quadratic 0-1 optimization
In many practical applications, the task is to optimize a non-linear objective function over the vertices of a well-studied polytope as, e.g., the matching polytope or the travelli...
Christoph Buchheim, Frauke Liers, Marcus Oswald
HPDC
2000
IEEE
13 years 12 months ago
Failure-Atomic File Access in an Interposed Network Storage System
This paper presents a recovery protocol for block I/O operations in Slice, a storage system architecture for highspeed LANs incorporating network-attached block storage. The goal ...
Darrell C. Anderson, Jeffrey S. Chase