Sciweavers

288 search results - page 28 / 58
» Inclusion Problems for Patterns with a Bounded Number of Var...
Sort
View
CIARP
2008
Springer
13 years 9 months ago
Cluster Stability Assessment Based on Theoretic Information Measures
Abstract. Cluster validation to determine the right number of clusters is an important issue in clustering processes. In this work, a strategy to address the problem of cluster val...
Damaris Pascual, Filiberto Pla, José Salvad...
STOC
2007
ACM
137views Algorithms» more  STOC 2007»
14 years 7 months ago
Testing k-wise and almost k-wise independence
In this work, we consider the problems of testing whether a distribution over {0, 1}n is k-wise (resp. ( , k)-wise) independent using samples drawn from that distribution. For the...
Noga Alon, Alexandr Andoni, Tali Kaufman, Kevin Ma...
TVLSI
1998
124views more  TVLSI 1998»
13 years 7 months ago
Computing support-minimal subfunctions during functional decomposition
Abstract— The growing popularity of look-up table (LUT)based field programmable gate arrays (FPGA’s) has renewed the interest in functional or Roth–Karp decomposition techni...
Christian Legl, Bernd Wurth, Klaus Eckl
LOPSTR
2005
Springer
14 years 1 months ago
Declarative Programming with Function Patterns
We propose an extension of functional logic languages that allows the definition of operations with patterns containing other defined operation symbols. Such “function patterns...
Sergio Antoy, Michael Hanus
COCO
1991
Springer
112views Algorithms» more  COCO 1991»
13 years 11 months ago
Randomized vs.Deterministic Decision Tree Complexity for Read-Once Boolean Functions
We consider the deterministic and the randomized decision tree complexities for Boolean functions, denoted DC(f) and RC(f), respectively. A major open problem is how small RC(f) ca...
Rafi Heiman, Avi Wigderson