2409 search results - page 139 / 482 » On Extended Regular Expressions |
150
click to vote
ML
2010
ACM
15 years 3 months ago
2010
ACM
Abstract A dynamic programming algorithm for constructing optimal dyadic decision trees was recently introduced, analyzed, and shown to be very effective for low dimensional data ...
149
click to vote
MP
2011
14 years 7 months ago
2011
Using variational analysis techniques, we study convex-composite optimization problems. In connection with such a problem, we introduce several new notions as variances of the clas...
116
Voted
ICDE
2008
IEEE
15 years 11 months ago
2008
IEEE
— Current database systems are tailored to efficiently evaluate Boolean expressions which are typically used as selection conditions to restrict the result set. We propose to ad...
127
click to vote
ICFP
2003
ACM
15 years 9 months ago
2003
ACM
In this paper we extend the model of program variables from the Refinement Calculus [2] in order to be able to reason more algebraically about recursive procedures with parameter...
164
Voted
MFCS
2001
Springer
15 years 9 months ago
2001
Springer
We consider words indexed by linear orderings. These extend finite, (bi-)infinite words and words on ordinals. We introduce finite automata and rational expressions for these w...