Sciweavers

1520 search results - page 247 / 304
» Class Hierarchy Specialization
Sort
View
STACS
1999
Springer
14 years 6 hour ago
A Complete and Tight Average-Case Analysis of Learning Monomials
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...
Rüdiger Reischuk, Thomas Zeugmann
KDD
1998
ACM
136views Data Mining» more  KDD 1998»
13 years 12 months ago
Integrating Classification and Association Rule Mining
Classification rule mining aims to discover a small set of rules in the database that forms an accurate classifier. Association rule mining finds all the rules existing in the dat...
Bing Liu, Wynne Hsu, Yiming Ma
ICCAD
1996
IEEE
87views Hardware» more  ICCAD 1996»
13 years 12 months ago
Partitioned ROBDDs - a compact, canonical and efficiently manipulable representation for Boolean functions
We presenta new representationfor Boolean functions called PartitionedROBDDs. In this representation we divide the Boolean space into `k' partitions and represent a function ...
Amit Narayan, Jawahar Jain, Masahiro Fujita, Alber...
ESA
1997
Springer
93views Algorithms» more  ESA 1997»
13 years 12 months ago
Quasi-Fully Dynamic Algorithms for Two-Connectivity, Cycle Equivalence and Related Problems
In thispaper we introduce a new class of dynamicgraphalgorithmscalledquasi-fully dynamic algorithms,which are much more general than the backtracking algorithmsand are much simple...
Madhukar R. Korupolu, Vijaya Ramachandran
ICCAD
1994
IEEE
105views Hardware» more  ICCAD 1994»
13 years 12 months ago
Register assignment through resource classification for ASIP microcode generation
Application Specific Instruction-Set Processors (ASIPs) offer designers the ability for high-speed data and control processing with the added flexibility needed for late design sp...
Clifford Liem, Trevor C. May, Pierre G. Paulin