Sciweavers

1421 search results - page 198 / 285
» Algorithms for subsequence combinatorics
Sort
View
TCSV
2008
115views more  TCSV 2008»
15 years 4 months ago
Dynamic Proposal Variance and Optimal Particle Allocation in Particle Filtering for Video Tracking
Abstract--This paper presents a novel particle allocation approach to particle filtering which minimizes the total tracking distortion for a fixed number of particles over a video ...
Pan Pan, Dan Schonfeld
TSP
2008
101views more  TSP 2008»
15 years 4 months ago
Reduced-Complexity Soft MIMO Detection Based on Causal and Noncausal Decision Feedback
We present a reduced-complexity soft detection (RCSD) scheme geared to multiple-input multiple-output (MIMO) systems with spatial domain multiplexing leading to layered space-time ...
Yong Li, Jaekyun Moon
114
Voted
TPDS
1998
98views more  TPDS 1998»
15 years 3 months ago
A Basic-Cycle Calculation Technique for Efficient Dynamic Data Redistribution
—Array redistribution is usually required to enhance algorithm performance in many parallel programs on distributed memory multicomputers. Since it is performed at run-time, ther...
Yeh-Ching Chung, Ching-Hsien Hsu, Sheng-Wen Bai
CORR
2008
Springer
179views Education» more  CORR 2008»
15 years 3 months ago
Realistic Haptic Rendering of Interacting Deformable Objects in Virtual Environments
A new computer haptics algorithm to be used in general interactive manipulations of deformable virtual objects is presented. In multimodal interactive simulations, haptic feedback ...
Christian Duriez, Frédéric Dubois, A...
NN
2007
Springer
15 years 3 months ago
From memory-based decisions to decision-based movements: A model of interval discrimination followed by action selection
The interval discrimination task is a classical experimental paradigm that is employed to study working memory and decision making and typically involves four phases. First, the s...
Prashant Joshi