Sciweavers

1552 search results - page 175 / 311
» On the Complexity of Constant Propagation
Sort
View
JMLR
2008
117views more  JMLR 2008»
15 years 6 months ago
Active Learning by Spherical Subdivision
We introduce a computationally feasible, "constructive" active learning method for binary classification. The learning algorithm is initially formulated for separable cl...
Falk-Florian Henrich, Klaus Obermayer
DKE
2007
101views more  DKE 2007»
15 years 6 months ago
Parameterized pattern queries
We introduce parameterized pattern queries as a new paradigm to extend traditional pattern expressions over sequence databases. A parameterized pattern is essentially a string mad...
Cédric du Mouza, Philippe Rigaux, Michel Sc...
JSW
2008
95views more  JSW 2008»
15 years 6 months ago
Architecture Support for Behavior-based Adaptive Checkpointing
Checkpointing is a commonly used approach to provide system fault-tolerance. However, using a constant checkpointing frequency may compromise the system's overall performance ...
Nianen Chen, Shangping Ren
MP
2008
129views more  MP 2008»
15 years 6 months ago
Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path
Abstract. Two corrector-predictor interior point algorithms are proposed for solving monotone linear complementarity problems. The algorithms produce a sequence of iterates in the ...
Florian A. Potra
MST
2006
105views more  MST 2006»
15 years 6 months ago
Selection Functions that Do Not Preserve Normality
The sequence selected from a sequence R(0)R(1) . . . by a language L is the subsequence of R that contains exactly the bits R(n + 1) such that the prefix R(0) . . . R(n) is in L. B...
Wolfgang Merkle, Jan Reimann