1686 search results - page 234 / 338 » Programs as polygraphs: computability and complexity |
139
click to vote
AGTIVE
2003
Springer
15 years 9 months ago
2003
Springer
Many polygon mesh algorithms operate in a local manner, yet are formally specified using global indexing schemes. This obscures the essence of these algorithms and makes their spe...
132
click to vote
ISMIS
2003
Springer
15 years 9 months ago
2003
Springer
As broadband access to the Internet becomes pervasive, the need for a 24 hours a day, seven days a week (24x7) interface within the client devices, requires a level of sophisticati...
142
Voted
ICALP
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. We present the first private information retrieval (PIR) scheme which is both, deterministically correct and has poly-logarithmic communication complexity. Our PIR proto...
132
Voted
SIGADA
2001
Springer
15 years 8 months ago
2001
Springer
The last years have seen an increasing, albeit restricted simulation of large-scale networks on shared memory parallel platforms. As the complexity of communication protocols and ...
140
click to vote
ICEIS
1999
IEEE
15 years 8 months ago
1999
IEEE
: Contour Estimation, Bayesian Estimation, Random Fields, Dynamic Programming, Multigrid Methods. This paper addresses contour estimation on images modeled as piecewise homogeneous...