Sciweavers

1578 search results - page 94 / 316
» Algorithmic randomness of continuous functions
Sort
View
CEC
2008
IEEE
15 years 4 months ago
Generating massive high-quality random numbers using GPU
— Pseudo-random number generators (PRNG) have been intensively used in many stochastic algorithms in artificial intelligence, computer graphics and other scientific computing. ...
Wai-Man Pang, Tien-Tsin Wong, Pheng-Ann Heng
CP
2000
Springer
15 years 2 months ago
Random 3-SAT: The Plot Thickens
Abstract. This paper presents an experimental investigation of the following questions: how does the averagecase complexity of random 3-SAT, understood as a function of the order (...
Cristian Coarfa, Demetrios D. Demopoulos, Alfonso ...
DAC
2004
ACM
15 years 1 months ago
A methodology to improve timing yield in the presence of process variations
The ability to control the variations in IC fabrication process is rapidly diminishing as feature sizes continue towards the sub-100 nm regime. As a result, there is an increasing...
Sreeja Raj, Sarma B. K. Vrudhula, Janet Meiling Wa...
ICML
2009
IEEE
15 years 4 months ago
Sparse higher order conditional random fields for improved sequence labeling
In real sequence labeling tasks, statistics of many higher order features are not sufficient due to the training data sparseness, very few of them are useful. We describe Sparse H...
Xian Qian, Xiaoqian Jiang, Qi Zhang, Xuanjing Huan...
ICPR
2008
IEEE
15 years 4 months ago
Face super-resolution using 8-connected Markov Random Fields with embedded prior
In patch based face super-resolution method, the patch size is usually very small, and neighbor patches’ relationship via overlapped regions is only to keep smoothness of recons...
Kai Guo, Xiaokang Yang, Rui Zhang, Guangtao Zhai, ...