Sciweavers

9562 search results - page 156 / 1913
» The probability of
Sort
View
136
Voted
ICIP
2003
IEEE
16 years 6 months ago
Fast probabilistic snake algorithm
Few people use the probability theory in order to achieve image segmentation with snake models. In this article1 , we are presenting an active contour algorithm based on a probabi...
Jerome Gilles, Bertrand Collin
ICPR
2004
IEEE
16 years 5 months ago
Resolution Enhancement by AdaBoost
This paper proposes a learning scheme based still image super-resolution reconstruction algorithm. Superresolution reconstruction is proposed as a binary classification problem an...
Bhaskar D. Rao, Junwen Wu, Mohan M. Trivedi
STOC
2001
ACM
140views Algorithms» more  STOC 2001»
16 years 4 months ago
Compatible sequences and a slow Winkler percolation
Two infinite 0-1 sequences are called compatible when it is possible to cast out 0's from both in such a way that they become complementary to each other. Answering a question...
Péter Gács
ICCAD
2004
IEEE
97views Hardware» more  ICCAD 2004»
16 years 1 months ago
Statistical design and optimization of SRAM cell for yield enhancement
In this paper, we have analyzed ond modeled the fiilure probabilities ofSRAM cells due to process parameter variations. A method to predict the yield of a memoiy chip based on the...
Saibal Mukhopadhyay, Hamid Mahmoodi-Meimand, Kaush...
ICDT
2007
ACM
87views Database» more  ICDT 2007»
15 years 10 months ago
Query Evaluation on a Database Given by a Random Graph
We consider random graphs, and their extensions to random structures, with edge probabilities of the form βn−α , where n is the number of vertices, α, β are fixed and α >...
Nilesh N. Dalvi