Sciweavers

76 search results - page 11 / 16
» Lower bounds for adaptive linearity tests
Sort
View
PODC
2009
ACM
14 years 8 months ago
Tight bounds for clock synchronization
d Abstract] Christoph Lenzen Computer Engineering and Networks Laboratory (TIK) ETH Zurich, 8092 Zurich, Switzerland lenzen@tik.ee.ethz.ch Thomas Locher Computer Engineering and N...
Christoph Lenzen, Thomas Locher, Roger Wattenhofer
APPROX
2011
Springer
284views Algorithms» more  APPROX 2011»
12 years 7 months ago
On Approximating the Number of Relevant Variables in a Function
In this work we consider the problem of approximating the number of relevant variables in a function given query access to the function. Since obtaining a multiplicative factor ap...
Dana Ron, Gilad Tsur
CONSTRAINTS
2007
112views more  CONSTRAINTS 2007»
13 years 7 months ago
Maxx: Test Pattern Optimisation with Local Search Over an Extended Logic
In the ECAD area, the Test Generation (TG) problem consists in finding an input vector test for some possible diagnosis (a set of faults) of a digital circuit. Such tests may have ...
Francisco Azevedo
ICASSP
2011
IEEE
12 years 11 months ago
Subspace constrained LU decomposition of FMLLR for rapid adaptation
This paper describes subspace constrained feature space maximum likelihood linear regression (FMLLR) for rapid adaptation. The test speaker’s FMLLR rotation matrix is decomposed...
Lei Jia, Dong Yu, Bo Xu
PODC
2003
ACM
14 years 26 days ago
Scalable and dynamic quorum systems
We investigate issues related to the probe complexity of quorum systems and their implementation in a dynamic environment. Our contribution is twofold. The first regards the algo...
Moni Naor, Udi Wieder