Sciweavers

2194 search results - page 262 / 439
» Improving HLRTA*( k )
Sort
View
VLSID
2001
IEEE
82views VLSI» more  VLSID 2001»
16 years 1 months ago
Efficient Signature-Based Fault Diagnosis Using Variable Size Windows
A technique for signature based diagnosis using windows of different sizes is presented. It allows to obtain increased diagnostic information from a given test at a lower cost, wi...
Thomas Clouqueur, Ozen Ercevik, Kewal K. Saluja, H...
STOC
2003
ACM
122views Algorithms» more  STOC 2003»
16 years 1 months ago
Learning juntas
We consider a fundamental problem in computational learning theory: learning an arbitrary Boolean function which depends on an unknown set of k out of n Boolean variables. We give...
Elchanan Mossel, Ryan O'Donnell, Rocco A. Servedio
STOC
2002
ACM
103views Algorithms» more  STOC 2002»
16 years 1 months ago
Approximate clustering via core-sets
In this paper, we show that for several clustering problems one can extract a small set of points, so that using those core-sets enable us to perform approximate clustering effici...
Mihai Badoiu, Sariel Har-Peled, Piotr Indyk
DCC
2008
IEEE
16 years 27 days ago
Sequences in abelian groups G of odd order without zero-sum subsequences of length exp ( G )
We present a new construction for sequences in the finite abelian group Cr n without zero-sum subsequences of length n, for odd n. This construction improves the maximal known car...
Yves Edel
DCC
2008
IEEE
16 years 27 days ago
High-Resolution Functional Quantization
Suppose a function of N real source variables XN 1 = (X1, X2, . . . , XN ) is desired at a destination constrained to receive a limited number of bits. If the result of evaluating...
Vinith Misra, Vivek K. Goyal, Lav R. Varshney