Sciweavers

20294 search results - page 156 / 4059
» Algorithmic Information Theory
Sort
View
TIP
2011
89views more  TIP 2011»
14 years 11 months ago
Random Phase Textures: Theory and Synthesis
This paper explores the mathematical and algorithmic properties of two sample-based microtexture models: random phase noise (RPN ) and asymptotic discrete spot noise (ADSN ). Thes...
Bruno Galerne, Yann Gousseau, Jean-Michel Morel
ASIAN
2009
Springer
274views Algorithms» more  ASIAN 2009»
15 years 5 months ago
Reducing Equational Theories for the Decision of Static Equivalence
Abstract. Static equivalence is a well established notion of indistinguishability of sequences of terms which is useful in the symbolic analysis of cryptographic protocols. Static ...
Steve Kremer, Antoine Mercier 0002, Ralf Treinen
141
Voted
CSL
2010
Springer
15 years 5 months ago
From Feasible Proofs to Feasible Computations
We shall discuss several situations in which it is possible to extract from a proof, be it a proof in a first-order theory or a propositional proof, some feasible computational inf...
Jan Krajícek
SIGECOM
2009
ACM
139views ECommerce» more  SIGECOM 2009»
15 years 11 months ago
Simple versus optimal mechanisms
The monopolist’s theory of optimal single-item auctions for agents with independent private values can be summarized by two statements. The first is from Myerson [8]: the optim...
Jason D. Hartline, Tim Roughgarden
116
Voted
WWW
2005
ACM
16 years 5 months ago
Applying NavOptim to minimise navigational effort
A major factor in the effectiveness of the interaction which users have with Web applications is the ease with which they can locate information and functionality which they are s...
David Lowe, Xiaoying Kong