6393 search results - page 365 / 1279 » Randomized Algorithms on the Mesh |
168
click to vote
ICPR
2006
IEEE
16 years 23 days ago
2006
IEEE
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...
189
click to vote
COCO
2004
Springer
16 years 4 days ago
2004
Springer
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...
176
click to vote
EUROCRYPT
2004
Springer
16 years 3 days ago
2004
Springer
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...
167
click to vote
SAT
2004
Springer
16 years 2 days ago
2004
Springer
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...
192
click to vote
FSTTCS
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. We propose a novel approach to clustering, based on deterministic analysis of random walks on the weighted graph associated with the clustering problem. The method is cen...