Sciweavers

CORR
2008
Springer
102views Education» more  CORR 2008»
14 years 17 days ago
Game Theory with Costly Computation
We develop a general game-theoretic framework for reasoning about strategic agents performing possibly costly computation. In this framework, many traditional game-theoretic resul...
Joseph Y. Halpern, Rafael Pass
CORR
2008
Springer
179views Education» more  CORR 2008»
14 years 17 days ago
Distributed Parameter Estimation in Sensor Networks: Nonlinear Observation Models and Imperfect Communication
The paper studies the problem of distributed static parameter (vector) estimation in sensor networks with nonlinear observation models and imperfect inter-sensor communication. We...
Soummya Kar, José M. F. Moura, Kavita Raman...
CORR
2008
Springer
90views Education» more  CORR 2008»
14 years 17 days ago
Dynamic Connectivity in ALOHA Ad Hoc Networks
We consider an ad hoc network which uses multihop routing and slotted ALOHA for its MAC contention. We show that the minimum time required for a packet to reach the destination fr...
Radha Krishna Ganti, Martin Haenggi
CORR
2008
Springer
135views Education» more  CORR 2008»
14 years 17 days ago
Conditional probability based significance tests for sequential patterns in multi-neuronal spike trains
URL for the abstract in place of http://abstract.citation (the square brackets will take care of linking). Remember that we decided to omit the journal details from the list in fav...
P. S. Sastry, K. P. Unnikrishnan
CORR
2008
Springer
149views Education» more  CORR 2008»
14 years 17 days ago
Phase Transitions on Fixed Connected Graphs and Random Graphs in the Presence of Noise
In this paper, we study phase transition behavior emerging from the interactions among multiple agents in the presence of noise. We propose a simple discrete-time model in which a...
Jialing Liu, Vikas Yadav, Hullas Sehgal, Joshua M....
CORR
2008
Springer
102views Education» more  CORR 2008»
14 years 17 days ago
Finding cores of random 2-SAT formulae via Poisson cloning
For the random 2-SAT formula F(n, p), let FC(n, p) be the formula left after the pure literal algorithm applied to F(n, p) stops. Using the recently developed Poisson cloning model...
Jeong Han Kim
CORR
2008
Springer
77views Education» more  CORR 2008»
14 years 17 days ago
The Peculiar Phase Structure of Random Graph Bisection
Allon G. Percus, Gabriel Istrate, Bruno Gonç...
CORR
2008
Springer
57views Education» more  CORR 2008»
14 years 17 days ago
Uniqueness of certain polynomials constant on a hyperplane
Jiri Lebl, Daniel Lichtblau
CORR
2008
Springer
106views Education» more  CORR 2008»
14 years 17 days ago
Quantum walk based search algorithms
In this survey paper we give an intuitive treatment of the discrete time quantization of classical Markov chains. Grover search and the quantum walk based search algorithms of Amba...
Miklos Santha
CORR
2008
Springer
121views Education» more  CORR 2008»
14 years 17 days ago
Rate-Distortion via Markov Chain Monte Carlo
We propose an approach to lossy source coding, utilizing ideas from Gibbs sampling, simulated annealing, and Markov Chain Monte Carlo (MCMC). The idea is to sample a reconstructio...
Shirin Jalali, Tsachy Weissman