Sciweavers

3238 search results - page 105 / 648
» Multi-return function call
Sort
View
NIPS
1990
13 years 9 months ago
Bumptrees for Efficient Function, Constraint and Classification Learning
A new class of data structures called "bumptrees" is described. These structures are useful for efficiently implementing a number of neural network related operations. A...
Stephen M. Omohundro
BMCBI
2008
130views more  BMCBI 2008»
13 years 8 months ago
Structural descriptor database: a new tool for sequence-based functional site prediction
Background: The Structural Descriptor Database (SDDB) is a web-based tool that predicts the function of proteins and functional site positions based on the structural properties o...
Juliana S. Bernardes, Jorge H. Fernandez, Ana Tere...
EDBT
2000
ACM
13 years 11 months ago
A Data Model for Effectively Computable Functions
the research activities. This abstract is to introduce the approach of a data model - EP data model. Its data structure is able to store as a finite set of nodes arbitrary effectiv...
Kevin H. Xu
STOC
1991
ACM
84views Algorithms» more  STOC 1991»
13 years 11 months ago
Self-Testing/Correcting for Polynomials and for Approximate Functions
The study of self-testing/correcting programs was introduced in [8] in order to allow one to use program P to compute function f without trusting that P works correctly. A self-te...
Peter Gemmell, Richard J. Lipton, Ronitt Rubinfeld...
DC
2010
13 years 8 months ago
A knowledge-based analysis of global function computation
Consider a distributed system N in which each agent has an input value and each communication link has a weight. Given a global function, that is, a function f whose value depends...
Joseph Y. Halpern, Sabina Petride