Sciweavers

405 search results - page 5 / 81
» On the Simulation of Tikhonov Random Processes
Sort
View
SODA
2012
ACM
170views Algorithms» more  SODA 2012»
13 years 4 days ago
Compression via matroids: a randomized polynomial kernel for odd cycle transversal
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
Stefan Kratsch, Magnus Wahlström
CSCWD
2009
Springer
15 years 4 months ago
Random stimulus generation with self-tuning
Constrained random simulation methodology still plays an important role in hardware verification due to the limited scalability of formal verification, especially for the large an...
Yanni Zhao, Jinian Bian, Shujun Deng, Zhiqiu Kong
ICCMS
2009
118views more  ICCMS 2009»
14 years 7 months ago
Optimized Parallel Implementation of Gillespie's First Reaction Method on Graphics Processing Units
The simulation of chemical reacting systems is one of the most challenging topics in Systems Biology, due to their complexity and inherent randomness. The Gillespie's Stochas...
Cristian Dittamo, Davide Cangelosi
ICIP
2006
IEEE
15 years 3 months ago
Discontinuity-Adaptive De-Interlacing Scheme Using Markov Random Field Model
— In this paper, a de-interlacing algorithm to find the optimal deinterlaced results given accuracy-limited motion information is proposed. The de-interlacing process is formula...
Min Li, Truong Q. Nguyen
WSC
2001
14 years 11 months ago
Using common random numbers for indifference-zone selection
This paper discusses the validity of using common random numbers (CRNs) with two-stage selection procedures to improve the possibility of correct selection and discusses the intri...
E. Jack Chen