581 search results - page 50 / 117 » An Automata Model for Trees with Ordered Data Values |
135
click to vote
FSTTCS
1993
Springer
15 years 10 months ago
1993
Springer
A for-loop is somewhat similar to an inductive argument. Just as the truth of a proposition P(n + 1) depends on the truth of P(n), the correctness of iteration n+1 of a for-loop de...
149
click to vote
HM
2007
Springer
16 years 7 days ago
2007
Springer
The connected facility location (ConFL) problem generalizes the facility location problem and the Steiner tree problem in graphs. Given a graph G = (V, E), a set of customers D ⊆...
161
Voted
AMAI
1999
Springer
15 years 5 months ago
1999
Springer
Temporal Constraint Satisfaction Problems (TCSP) is a well known approach for representing and processing temporal knowledge. Important properties of the knowledge can be inferred...
165
click to vote
NECO
2006
15 years 6 months ago
2006
The application of boosting technique to the regression problems has received relatively little attention in contrast to the research aimed at classification problems. This paper ...
198
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: Cluster analysis is an important technique for the exploratory analysis of biological data. Such data is often high-dimensional, inherently noisy and contains outliers...