Sciweavers

1146 search results - page 78 / 230
» Finite cupping sets
Sort
View
CIE
2008
Springer
13 years 11 months ago
Perfect Local Computability and Computable Simulations
We study perfectly locally computable structures, which are (possibly uncountable) structures S that have highly effective presentations of their local properties. We show that eve...
Russell Miller, Dustin Mulcahey
ANOR
2008
69views more  ANOR 2008»
13 years 9 months ago
Moment characterization of matrix exponential and Markovian arrival processes
This paper provides a general framework for establishing the relation between various moments of matrix exponential and Markovian processes. Based on this framework we present an a...
Levente Bodrog, András Horváth, Mikl...
CPC
2006
92views more  CPC 2006»
13 years 9 months ago
Waiting for a Bat to Fly By (in Polynomial Time)
We observe returns of a simple random walk on a finite graph to a fixed node, and would like to infer properties of the graph, in particular properties of the spectrum of the trans...
Itai Benjamini, Gady Kozma, László L...
IPL
2008
109views more  IPL 2008»
13 years 9 months ago
Description and analysis of a bottom-up DFA minimization algorithm
Abstract. We establish linear-time reductions between the minimization of a deterministic finite automaton (DFA) and the conjunction of 3 subproblems: the minimization of a strongl...
Jorge Almeida, Marc Zeitoun
MOR
2010
79views more  MOR 2010»
13 years 3 months ago
A Geometric Proof of Calibration
We provide yet another proof of the existence of calibrated forecasters; it has two merits. First, it is valid for an arbitrary finite number of outcomes. Second, it is short and ...
Shie Mannor, Gilles Stoltz