Sciweavers

2693 search results - page 222 / 539
» On Computing Complex Navigation Functions
Sort
View
CVPR
2000
IEEE
16 years 8 months ago
Learning in Gibbsian Fields: How Accurate and How Fast Can It Be?
?Gibbsian fields or Markov random fields are widely used in Bayesian image analysis, but learning Gibbs models is computationally expensive. The computational complexity is pronoun...
Song Chun Zhu, Xiuwen Liu
FOCS
2003
IEEE
15 years 12 months ago
On the Implementation of Huge Random Objects
We initiate a general study of pseudo-random implementations of huge random objects, and apply it to a few areas in which random objects occur naturally. For example, a random obj...
Oded Goldreich, Shafi Goldwasser, Asaf Nussboim
VLSID
1997
IEEE
109views VLSI» more  VLSID 1997»
15 years 10 months ago
Delay-Insensitive Carry-Lookahead Adders
Integer addition is one of the most important operations in digital computer systems because the performance of processors is significantly influenced by the speed of their adde...
Fu-Chiung Cheng, Stephen H. Unger, Michael Theobal...
CSR
2008
Springer
15 years 8 months ago
A Semantic Proof of Polytime Soundness of Light Affine Logic
We define a denotational semantics for Light Affine Logic (LAL) which has the property that denotations of functions are polynomial time computable by construction of the model. Th...
Ugo Dal Lago, Martin Hofmann
WWW
2004
ACM
16 years 7 months ago
Personalization in distributed e-learning environments
Personalized support for learners becomes even more important, when e-Learning takes place in open and dynamic learning and information networks. This paper shows how to realize p...
Peter Dolog, Nicola Henze, Wolfgang Nejdl, Michael...