Sciweavers

4860 search results - page 698 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
CORR
2007
Springer
182views Education» more  CORR 2007»
15 years 6 months ago
Triangulating the Real Projective Plane
We consider the problem of computing a triangulation of the real projective plane P2 , given a finite point set P = {p1, p2, . . . , pn} as input. We prove that a triangulation of...
Mridul Aanjaneya, Monique Teillaud
CSDA
2007
109views more  CSDA 2007»
15 years 6 months ago
Improving the computation of censored quantile regressions
Abstract. Censored quantile regressions (CQR) are a valuable tool in economics and engineering. The computation of estimators is highly complex and the performance of standard meth...
Bernd Fitzenberger, Peter Winker
KI
2006
Springer
15 years 6 months ago
A New n-ary Existential Quantifier in Description Logics
Motivated by a chemical process engineering application, we introduce a new concept constructor in Description Logics (DLs), an n-ary variant of the existential restriction constr...
JCP
2007
121views more  JCP 2007»
15 years 6 months ago
Learning by Discrimination: A Constructive Incremental Approach
Abstract— This paper presents i-AA1 , a constructive, incremental learning algorithm for a special class of weightless, self-organizing networks. In i-AA1 , learning consists of ...
Christophe G. Giraud-Carrier, Tony R. Martinez
CORR
2004
Springer
107views Education» more  CORR 2004»
15 years 6 months ago
Encapsulation for Practical Simplification Procedures
ACL2 was used to prove properties of two simplification procedures. The procedures differ in complexity but solve the same programming problem that arises in the context of a reso...
Olga Shumsky Matlin, William McCune