Sciweavers

5995 search results - page 229 / 1199
» Algorithmic Game Theory
Sort
View
TSP
2008
91views more  TSP 2008»
15 years 5 months ago
Nonlinear and Nonideal Sampling: Theory and Methods
We study a sampling setup where a continuous-time signal is mapped by a memoryless, invertible and nonlinear transformation, and then sampled in a nonideal manner. Such scenarios a...
Tsvi G. Dvorkind, Yonina C. Eldar, Ewa Matusiak
ILP
2005
Springer
15 years 11 months ago
Online Closure-Based Learning of Relational Theories
Online learning algorithms such as Winnow have received much attention in Machine Learning. Their performance degrades only logarithmically with the input dimension, making them us...
Frédéric Koriche
ENTCS
2008
89views more  ENTCS 2008»
15 years 5 months ago
CC(X): Semantic Combination of Congruence Closure with Solvable Theories
We present a generic congruence closure algorithm for deciding ground formulas in the combination of the theory of equality with uninterpreted symbols and an arbitrary built-in so...
Sylvain Conchon, Evelyne Contejean, Johannes Kanig...
TIP
2011
89views more  TIP 2011»
15 years 9 days 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 6 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