Sciweavers

3600 search results - page 668 / 720
» The settling-time reducibility ordering
Sort
View
SIGMOD
1996
ACM
151views Database» more  SIGMOD 1996»
14 years 1 months ago
BIRCH: An Efficient Data Clustering Method for Very Large Databases
Finding useful patterns in large datasets has attracted considerable interest recently, and one of the most widely st,udied problems in this area is the identification of clusters...
Tian Zhang, Raghu Ramakrishnan, Miron Livny
DISCO
1993
156views Hardware» more  DISCO 1993»
14 years 1 months ago
Variant Handling, Inheritance and Composition in the ObjectMath Computer Algebra Environment
ObjectMath is a high-level programming environment and modeling language for scientific computing which supports variants and graphical browsing in the environment and integrates o...
Peter Fritzson, Vadim Engelson, Lars Viklund
STOC
1993
ACM
141views Algorithms» more  STOC 1993»
14 years 1 months ago
Bounds for the computational power and learning complexity of analog neural nets
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
Wolfgang Maass
RTSS
1992
IEEE
14 years 1 months ago
Allocation of periodic task modules with precedence and deadline constraints in distributed real-time systems
This paper addresses the problem of allocating (assigning and scheduling) periodic task modules to processing nodes in distributed real-time systems subject to task precedence and ...
Chao-Ju Hou, Kang G. Shin
SC
1992
ACM
14 years 1 months ago
Optimal Tracing and Replay for Debugging Message-Passing Parallel Programs
A common debugging strategy involves reexecuting a program (on a given input) over and over, each time gaining more information about bugs. Such techniques can fail on message-pas...
Robert H. B. Netzer, Barton P. Miller