Sciweavers

8109 search results - page 1099 / 1622
» A Model of Component-Based Programming
Sort
View
ISMB
2000
15 years 8 months ago
A Probabilistic Learning Approach to Whole-Genome Operon Prediction
We present a computational approach to predicting operons in the genomes of prokaryotic organisms. Our approach uses machine learning methods to induce predictive models for this ...
Mark Craven, David Page, Jude W. Shavlik, Joseph B...
DS
1997
97views Database» more  DS 1997»
15 years 8 months ago
A Formalization of ODMG Queries
The ODMG proposal has helped to focus the work on object-oriented databases (OODBs) onto a common object model and query language. Nevertheless there are several shortcomings of t...
Holger Riedel, Marc H. Scholl
AAAI
1990
15 years 8 months ago
Understanding Natural Language with Diagrams
We describe a program, BEATRIX, that can understand textbook physics problems specified by a combination of English text and a diagram. The result of the understanding process is ...
Gordon S. Novak, William C. Bulko
CC
2010
Springer
135views System Software» more  CC 2010»
15 years 7 months ago
Counting Irreducible Components of Complex Algebraic Varieties
Abstract. We present an algorithm for counting the irreducible components of a complex algebraic variety defined by a fixed number of polynomials encoded as straight-line programs ...
Peter Bürgisser, Peter Scheiblechner
CORR
2010
Springer
101views Education» more  CORR 2010»
15 years 7 months ago
Computing the Least Fixed Point of Positive Polynomial Systems
We consider equation systems of the form X1 = f1(X1, . . . , Xn), . . . , Xn = fn(X1, . . . , Xn) where f1, . . . , fn are polynomials with positive real coefficients. In vector fo...
Javier Esparza, Stefan Kiefer, Michael Luttenberge...
« Prev « First page 1099 / 1622 Last » Next »