Sciweavers

681 search results - page 27 / 137
» et 2006
Sort
View
ERSHOV
2006
Springer
15 years 1 months ago
Program Generation in the Equivalent Transformation Computation Model Using the Squeeze Method
In the equivalent transformation (ET) computation model, a specification provides background knowledge in a problem domain, a program is a set of prioritized rewriting rules, and c...
Kiyoshi Akama, Ekawit Nantajeewarawat, Hidekatsu K...
86
Voted
IJON
1998
119views more  IJON 1998»
14 years 9 months ago
Comment on "Recurrent neural networks: A constructive algorithm, and its properties"
In their paper [1], Tsoi and Tan present what they call a "canonical form", which they claim to be identical to that proposed in Nerrand et al [2]. They also claim that ...
Léon Personnaz, Gérard Dreyfus
60
Voted
JCT
2006
55views more  JCT 2006»
14 years 9 months ago
A proof of the q, t-square conjecture
We prove a combinatorial formula conjectured by Loehr and Warrington for the coefficient of the sign character in (pn). Here denotes the Bergeron-Garsia nabla operator, and pn is a...
Mahir Can, Nicholas A. Loehr
PRL
2006
105views more  PRL 2006»
14 years 9 months ago
Automatic parameter selection for a k-segments algorithm for computing principal curves
This paper studies the k-segments algorithm proposed by Verbeek et al. [Verbeek, J.J., Vlassis, N., Krose, B., 2002. A k-segments algorithm for finding principal curves, Pattern R...
Haonan Wang, Thomas C. M. Lee
ORL
1998
97views more  ORL 1998»
14 years 9 months ago
The complexity of cover inequality separation
Crowder et al. (Oper. Res. 31 (1983) 803–834) conjectured that the separation problem for cover inequalities for binary integer programs is polynomially solvable. We show that t...
Diego Klabjan, George L. Nemhauser, Craig A. Tovey