5169 search results - page 95 / 1034 » Locality approximation using time |
180
Voted
ICALP
2011
Springer
14 years 6 months ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
165
Voted
ICASSP
2011
IEEE
14 years 6 months ago
2011
IEEE
This paper presents a method for the localization of reflectors in an acoustic environment, using robust beamforming techniques and a cylindrical microphone array, for which an i...
135
Voted
ESOP
2011
Springer
14 years 6 months ago
2011
Springer
Programs written in scripting languages employ idioms that confound conventional type systems. In this paper, we highlight one important set of related idioms: the use of local con...
102
click to vote
DAGSTUHL
2006
15 years 4 months ago
2006
Given a set of monomials, the Minimum AND-Circuit problem asks for a circuit that computes these monomials using AND-gates of fan-in two and being of minimum size. We prove that t...
117
Voted
CORR
2010
Springer
15 years 1 months ago
2010
Springer
—We apply large deviations theory to study asymptotic performance of running consensus distributed detection in sensor networks. Running consensus is a stochastic approximation t...