Sciweavers

9370 search results - page 1809 / 1874
» An Abstract Notion of Application
Sort
View
STOC
1993
ACM
141views Algorithms» more  STOC 1993»
13 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
STACS
1992
Springer
13 years 11 months ago
Secure Commitment Against A Powerful Adversary
abstract Rafail Ostrovskyy Ramarathnam Venkatesanz Moti Yungx Secure commitment is a primitive enabling information hiding, which is one of the most basic tools in cryptography. S...
Rafail Ostrovsky, Ramarathnam Venkatesan, Moti Yun...
WADS
1989
Springer
84views Algorithms» more  WADS 1989»
13 years 11 months ago
Skip Lists: A Probabilistic Alternative to Balanced Trees
rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...
William Pugh
CICLING
2010
Springer
13 years 11 months ago
Word Length n-Grams for Text Re-use Detection
Abstract. The automatic detection of shared content in written documents –which includes text reuse and its unacknowledged commitment, plagiarism– has become an important probl...
Alberto Barrón-Cedeño, Chiara Basile...
BIRTHDAY
2007
Springer
13 years 11 months ago
Deriving Specifications for Systems That Are Connected to the Physical World
Well understood methods exist for developing programs from formal specifications. Not only do such methods offer a precise check that certain sorts of deviations from their specifi...
Cliff B. Jones, Ian J. Hayes, Michael A. Jackson
« Prev « First page 1809 / 1874 Last » Next »