455 search results - page 49 / 91 » On Trees and Noncrossing Partitions |
169
click to vote
ILP
2003
Springer
15 years 11 months ago
2003
Springer
In many data mining tools that support regression tasks, training data are stored in a single table containing both the target field (dependent variable) and the attributes (indepe...
228
click to vote
VISUALIZATION
1996
IEEE
15 years 10 months ago
1996
IEEE
We present a method for producing real-time volume visualizations of continuously captured, arbitrarily-oriented 2D arrays (slices) of data. Our system constructs a 3D representat...
178
click to vote
TJS
2010
15 years 4 months ago
2010
This paper presents a novel host-based combinatorial method based on k-Means clustering and ID3 decision tree learning algorithms for unsupervised classification of anomalous and ...
167
click to vote
ECCB
2008
IEEE
16 years 22 days ago
2008
IEEE
Motivation: Mapping of remote evolutionary links is a classic computational problem of much interest. Relating protein families allows for functional and structural inference on u...
156
click to vote
STACS
2007
Springer
16 years 11 days ago
2007
Springer
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...