Sciweavers

31387 search results - page 5913 / 6278
» Abstracts
Sort
View
SPAA
1993
ACM
15 years 11 months ago
Asymptotically Tight Bounds for Performing BMMC Permutations on Parallel Disk Systems
d Abstract) Thomas H. Cormen Leonard F. Wisniewski Department of Mathematics and Computer Science Dartmouth College We give asymptotically equal lower and upper bounds for the num...
Thomas H. Cormen, Leonard F. Wisniewski
STACS
1993
Springer
15 years 11 months ago
The Complexity of Logic-Based Abduction
Abduction is an important form of nonmonotonic reasoning allowing one to find explanations for certain symptoms or manifestations. When the application domain is described by a l...
Thomas Eiter, Georg Gottlob
STOC
1993
ACM
123views Algorithms» more  STOC 1993»
15 years 11 months ago
Constructing small sample spaces satisfying given constraints
Abstract. The subject of this paper is nding small sample spaces for joint distributions of n discrete random variables. Such distributions are often only required to obey a certa...
Daphne Koller, Nimrod Megiddo
STOC
1993
ACM
141views Algorithms» more  STOC 1993»
15 years 11 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
TAPSOFT
1993
Springer
15 years 11 months ago
Exception Handling and Term Labelling
: We propose a new algebraic framework for exception handling which is powerful enough to cope with many exception handling features such that recovery, implicit propagation of exc...
Gilles Bernot, Pascale Le Gall
« Prev « First page 5913 / 6278 Last » Next »