Sciweavers

73 search results - page 12 / 15
» Fast Monte Carlo Algorithms for Permutation Groups
Sort
View
ICASSP
2011
IEEE
12 years 11 months ago
Video object tracking with differential Structural SIMilarity index
The Structural SIMilarity Measure (SSIM) combined with the sequential Monte Carlo approach has been shown [1] to achieve more reliable video object tracking performance, compared ...
Artur Loza, Fanglin Wang, Jie Yang, Lyudmila Mihay...
EGH
2010
Springer
13 years 5 months ago
GPU random numbers via the tiny encryption algorithm
Random numbers are extensively used on the GPU. As more computation is ported to the GPU, it can no longer be treated as rendering hardware alone. Random number generators (RNG) a...
Fahad Zafar, Marc Olano, Aaron Curtis
ICCAD
1993
IEEE
101views Hardware» more  ICCAD 1993»
13 years 11 months ago
Convexity-based algorithms for design centering
A new technique for design centering, and for polytope approximation of the feasible region for a design are presented. In the rst phase, the feasible region is approximated by a ...
Sachin S. Sapatnekar, Pravin M. Vaidya, Steve M. K...
KDD
2009
ACM
167views Data Mining» more  KDD 2009»
14 years 2 months ago
Anomalous window discovery through scan statistics for linear intersecting paths (SSLIP)
Anomalous windows are the contiguous groupings of data points. In this paper, we propose an approach for discovering anomalous windows using Scan Statistics for Linear Intersectin...
Lei Shi, Vandana Pursnani Janeja
PRL
2006
139views more  PRL 2006»
13 years 7 months ago
Adaptive Hausdorff distances and dynamic clustering of symbolic interval data
This paper presents a partitional dynamic clustering method for interval data based on adaptive Hausdorff distances. Dynamic clustering algorithms are iterative two-step relocatio...
Francisco de A. T. de Carvalho, Renata M. C. R. de...