Sciweavers

4377 search results - page 712 / 876
» Mass problems and randomness
Sort
View
SPAA
2005
ACM
15 years 11 months ago
Parallelizing time with polynomial circuits
We study the problem of asymptotically reducing the runtime of serial computations with circuits of polynomial size. We give an algorithmic size-depth tradeoff for parallelizing ...
Ryan Williams
CTRSA
2005
Springer
154views Cryptology» more  CTRSA 2005»
15 years 11 months ago
Fast and Proven Secure Blind Identity-Based Signcryption from Pairings
We present the first blind identity-based signcryption (BIBSC). We formulate its security model and define the security notions of blindness and parallel one-more unforgeability ...
Tsz Hon Yuen, Victor K. Wei
ECAL
2005
Springer
15 years 11 months ago
The Genetic Coding Style of Digital Organisms
Recently, all the human genes were identified. But understanding the functions coded in the genes is of course a much harder problem. We are used to view DNA as some sort of a comp...
Philip Gerlee, Torbjörn Lundh
ECML
2005
Springer
15 years 11 months ago
Annealed Discriminant Analysis
Abstract. Motivated by the analogies to statistical physics, the deterministic annealing (DA) method has successfully been demonstrated in a variety of application. In this paper, ...
Gang Wang, Zhihua Zhang, Frederick H. Lochovsky
EMMCVPR
2005
Springer
15 years 11 months ago
Color Correction of Underwater Images for Aquatic Robot Inspection
In this paper, we consider the problem of color restoration using statistical priors. This is applied to color recovery for underwater images, using an energy minimization formulat...
Luz Abril Torres-Méndez, Gregory Dudek