Sciweavers

141 search results - page 13 / 29
» Fast probabilistic snake algorithm
Sort
View
ICCAD
2003
IEEE
127views Hardware» more  ICCAD 2003»
15 years 6 months ago
A Probabilistic-Based Design Methodology for Nanoscale Computation
As current silicon-based techniques fast approach their practical limits, the investigation of nanoscale electronics, devices and system architectures becomes a central research p...
R. Iris Bahar, Joseph L. Mundy, Jie Chen
VLDB
2011
ACM
276views Database» more  VLDB 2011»
14 years 4 months ago
Ranking queries on uncertain data
Uncertain data is inherent in a few important applications such as environmental surveillance and mobile object tracking. Top-k queries (also known as ranking queries) are often n...
Ming Hua, Jian Pei, Xuemin Lin
DAC
2006
ACM
15 years 10 months ago
Statistical timing based on incomplete probabilistic descriptions of parameter uncertainty
Existing approaches to timing analysis under uncertainty are based on restrictive assumptions. Statistical STA techniques assume that the full probabilistic distribution of parame...
Wei-Shen Wang, Vladik Kreinovich, Michael Orshansk...
DC
2008
14 years 9 months ago
Fast computation by population protocols with a leader
Fast algorithms are presented for performing computations in a probabilistic population model. This is a variant of the standard population protocol model--in which finite-state ag...
Dana Angluin, James Aspnes, David Eisenstat
CODES
2008
IEEE
15 years 4 months ago
Static analysis for fast and accurate design space exploration of caches
Application-specific system-on-chip platforms create the opportunity to customize the cache configuration for optimal performance with minimal chip estate. Simulation, in partic...
Yun Liang, Tulika Mitra