11345 search results - page 135 / 2269 » Foundations of Computer Science |
106
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
We introduce a new approach to computing an approximately maximum s-t flow in a capacitated, undirected graph. This flow is computed by solving a sequence of electrical flow probl...
119
Voted
FOCS
2009
IEEE
15 years 9 months ago
2009
IEEE
Canetti, Goldreich, Goldwasser, and Micali (STOC 2000) introduced the notion of resettable zeroknowledge proofs, where the protocol must be zero-knowledge even if a cheating veriļ...
184
click to vote
Book
"Java for the Beginning Programmer teaches Java to someone with absolutely no programming background. This book focuses on core programming topics such as variables, looping, ...
101
Voted
ICIP
1997
IEEE
16 years 4 months ago
1997
IEEE
We develop a new approach to image denoising based on complexity regularization. This technique presents a flexible alternative to the more conventional l2 , l1 , and Besov regula...
135
Voted
LICS
2008
IEEE
15 years 9 months ago
2008
IEEE
Taitās method (a.k.a. proof by logical relations) is a powerful proof technique frequently used for showing foundational properties of languages based on typed Ī»-calculi. Histo...