Sciweavers

5115 search results - page 192 / 1023
» On Randomized Lanczos Algorithms
Sort
View
KES
2007
Springer
16 years 1 months ago
Random Germs and Stochastic Watershed for Unsupervised Multispectral Image Segmentation
This paper extends the use of stochastic watershed, recently introduced by Angulo and Jeulin [1], to unsupervised segmentation of multispectral images. Several probability density ...
Guillaume Noyel, Jesús Angulo, Dominique Je...
ICPR
2006
IEEE
16 years 29 days ago
A Conditional Random Field Model for Video Super-resolution
In this paper, we propose a learning-based method for video super-resolution. There are two main contributions of the proposed method. First, information from cameras with differe...
Dan Kong, Mei Han, Wei Xu, Hai Tao, Yihong Gong
COCO
2004
Springer
121views Algorithms» more  COCO 2004»
16 years 10 days ago
Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments
We prove a very general lower bound technique for quantum and randomized query complexity, that is easy to prove as well as to apply. To achieve this, we introduce the use of Kolm...
Sophie Laplante, Frédéric Magniez
EUROCRYPT
2004
Springer
16 years 10 days ago
Short Signatures Without Random Oracles
We describe a short signature scheme that is strongly existentially unforgeable under an adaptive chosen message attack in the standard security model. Our construction works in g...
Dan Boneh, Xavier Boyen
SAT
2004
Springer
117views Hardware» more  SAT 2004»
16 years 8 days ago
A Random Constraint Satisfaction Problem That Seems Hard for DPLL
Abstract. This paper discusses an NP-complete constraint satisfaction problem which appears to share many of the threshold characteristics of SAT but is similar to XOR-SAT and so i...
Harold S. Connamacher