Sciweavers

204 search results - page 26 / 41
» Parameterizations of Test Cover with Bounded Test Sizes
Sort
View
90
Voted
KDD
1998
ACM
129views Data Mining» more  KDD 1998»
15 years 2 months ago
Data Reduction Based on Hyper Relations
Data reduction makes datasets smaller but preserves classication structures of interest. It is an important area of research in data mining and databases. In this paper we present...
Hui Wang, Ivo Düntsch, David A. Bell
VLSID
2006
IEEE
183views VLSI» more  VLSID 2006»
15 years 4 months ago
Design Challenges for High Performance Nano-Technology
This tutorial present the key aspects of design challenges and its solutions that are being experienced in VLSI design in the era of nano technology. The focus will be on design c...
Goutam Debnath, Paul J. Thadikaran
84
Voted
TCS
2008
14 years 10 months ago
Expanders and time-restricted branching programs
The replication number of a branching program is the minimum number R such that along every accepting computation at most R variables are tested more than once; the sets of variab...
Stasys Jukna
DAM
1998
88views more  DAM 1998»
14 years 10 months ago
Neither Reading Few Bits Twice Nor Reading Illegally Helps Much
We first consider so-called (1,+s)-branching programs in which along every consistent path at most s variables are tested more than once. We prove that any such program computing...
Stasys Jukna, Alexander A. Razborov
JMLR
2006
134views more  JMLR 2006»
14 years 10 months ago
Considering Cost Asymmetry in Learning Classifiers
Receiver Operating Characteristic (ROC) curves are a standard way to display the performance of a set of binary classifiers for all feasible ratios of the costs associated with fa...
Francis R. Bach, David Heckerman, Eric Horvitz