Result 1 to 20 of 259 total
The importance of the past in interval temporal logics: the case of propositional neighborhood logic. (English)
Artikis, Alexander (ed.) et al., Logic programs, norms and action. Essays in honor of Marek J. Sergot on the occasion of his 60th birthday. Berlin: Springer (ISBN 978-3-642-29413-6/pbk). Lecture Notes in Computer Science 7360. Lecture Notes in Artificial Intelligence, 79-102 (2012).
1
Special issue: Games, Automata, logic, and formal verification (GandALF 2010). Selected papers based on the presentations at the 1st symposium, Minori, Itay, June 17‒18, 2010. (English)
Int. J. Found. Comput. Sci. 23, No. 3, 555-711 (2012).
2
The weak limit of Ising models on locally tree-like graphs. (English)
Probab. Theory Relat. Fields 152, No. 1-2, 31-51 (2012).
3
Majority dynamics on trees and the dynamic cavity method. (English)
Ann. Appl. Probab. 21, No. 5, 1694-1748 (2011).
4
Reconstruction and clustering in random constraint satisfaction problems. (English)
SIAM J. Discrete Math. 25, No. 2, 771-808 (2011).
5
A uniform framework for temporal functional dependencies with multiple granularities. (English)
Pfoser, Dieter (ed.) et al., Advances in spatial and temporal databases. 12th international symposium, SSTD 2011, Minneapolis, MN, USA, August 24‒26, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22921-3/pbk). Lecture Notes in Computer Science 6849, 404-421 (2011).
6
Optimal coding for the deletion channel with small deletion probability. (English)
Comput. Res. Repos. 2011, Article No. 1104.5546 (2011).
7
Subexponential convergence for information aggregation on regular trees. (English)
Comput. Res. Repos. 2011, Article No. 1104.2939 (2011).
8
Optimal tableau systems for propositional neighborhood logic over all, dense, and discrete linear orders. (English)
Brünnler, Kai (ed.) et al., Automated reasoning with analytic tableaux and related methods. 20th international conference, TABLEAUX 2011, Bern, Switzerland, July 4‒8, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22118-7/pbk). Lecture Notes in Computer Science 6793. Lecture Notes in Artificial Intelligence, 73-87 (2011).
9
Gossip PCA. (English)
Comput. Res. Repos. 2011, Article No. 1103.4195 (2011).
10
Compressed sensing over \ell\_p-balls: minimax mean square error. (English)
Comput. Res. Repos. 2011, Article No. 1103.1943 (2011).
11
Information theoretic limits on learning stochastic differential equations. (English)
Comput. Res. Repos. 2011, Article No. 1103.1689 (2011).
12
Localization from incomplete noisy distance measurements. (English)
Comput. Res. Repos. 2011, Article No. 1103.1417 (2011).
13
Maximum likelihood estimation of mixtures of factor analyzers (English)
Computational Statistics & Data Analysis 55, No. 9, 2712-2723 (2011).
14
Applications of the lindeberg principle in communications and statistical learning (English)
IEEE Transactions on Information Theory 57, No. 4, 2440-2450 (2011).
15
The dynamics of message passing on dense graphs, with applications to compressed sensing (English)
IEEE Transactions on Information Theory 57, No. 2, 764-785 (2011).
16
The noise-sensitivity phase transition in compressed sensing (English)
IEEE Transactions on Information Theory 57, No. 10, 6920-6941 (2011).
17
An optimal decision procedure for MPNL over the integers (English)
GandALF, 192-206 (2011).
18
Fast convergence of natural bargaining dynamics in exchange networks (English)
SODA, 1518-1537 (2011).
19
The light side of interval temporal logic: the bernays-schönfinkel’s fragment of CDT (English)
TIME, 123-130 (2011).
20
Result 1 to 20 of 259 total
Start
Contact
Print
General Help
