Sciweavers

4315 search results - page 133 / 863
» Sorting in linear time
Sort
View
PDPTA
2004
13 years 10 months ago
Static Performance Evaluation for Memory-Bound Computing: The MBRAM Model
We present the MBRAM model for static evaluation of the performance of memory-bound programs. The MBRAM model predicts the actual running time of a memory-bound program directly fr...
Gene Cooperman, Xiaoqin Ma, Viet Ha Nguyen
ISAAC
2004
Springer
88views Algorithms» more  ISAAC 2004»
14 years 2 months ago
On the Range Maximum-Sum Segment Query Problem
The range minimum query problem, RMQ for short, is to preprocess a sequence of real numbers A[1 . . . n] for subsequent queries of the form: “Given indices i, j, what is the ind...
Kuan-Yu Chen, Kun-Mao Chao
ICIP
1998
IEEE
14 years 10 months ago
Adaptive Search Center Non-Linear Three Step Search
This paper presents a new motion estimation algorithm using an adaptive search center predicted from its adjacent blocks, and a non-linear center biased search point pattern. It d...
Hing Y. Chung, Paul Y. S. Cheung, N. H. C. Yung
KDD
2008
ACM
183views Data Mining» more  KDD 2008»
14 years 9 months ago
A bayesian mixture model with linear regression mixing proportions
Classic mixture models assume that the prevalence of the various mixture components is fixed and does not vary over time. This presents problems for applications where the goal is...
Xiuyao Song, Chris Jermaine, Sanjay Ranka, John Gu...
ICRA
1998
IEEE
110views Robotics» more  ICRA 1998»
14 years 1 months ago
Generating Robust Trajectories in the Presence of Ordinary and Linear-Self-Motion Singularities
An algorithm is presented which computes feasible manipulator trajectories along fixed paths in the presence of kinematic singularities. The resulting trajectories are close to mi...
John E. Lloyd, Vincent Hayward