Sciweavers

8728 search results - page 1365 / 1746
» On Reduct Construction Algorithms
Sort
View
HT
1997
ACM
15 years 11 months ago
What the Query Told the Link: The Integration of Hypertext and Information Retrieval
Traditionally hypertexts have been limited in size by the manual effort required to create hypertext links. In addition, large hyper–linked collections may overwhelm users with ...
Gene Golovchinsky
DAC
1996
ACM
15 years 11 months ago
Computing Parametric Yield Adaptively Using Local Linear Models
Abstract A divide-and-conquer algorithm for computing the parametric yield of large analog circuits is presented. The algorithm targets applications whose performance spreads could...
Mien Li, Linda S. Milor
STOC
1996
ACM
100views Algorithms» more  STOC 1996»
15 years 11 months ago
The Linear-Array Conjecture in Communication Complexity is False
A linear array network consists of k + 1 processors P0; P1; : : : ; Pk with links only between Pi and Pi+1 0 i k. It is required to compute some boolean function f x; y in this n...
Eyal Kushilevitz, Nathan Linial, Rafail Ostrovsky
ICCAD
1994
IEEE
76views Hardware» more  ICCAD 1994»
15 years 11 months ago
An efficient procedure for the synthesis of fast self-testable controller structures
The BIST implementation of a conventionally synthesized controller in most cases requires the integration of an additional register only for test purposes. This leads to some seri...
Sybille Hellebrand, Hans-Joachim Wunderlich
ECML
1993
Springer
15 years 11 months ago
Complexity Dimensions and Learnability
In machine learning theory, problem classes are distinguished because of di erences in complexity. In 6 , a stochastic model of learning from examples was introduced. This PAClear...
Shan-Hwei Nienhuys-Cheng, Mark Polman
« Prev « First page 1365 / 1746 Last » Next »