150 search results - page 20 / 30 » Traversing a set of points with a minimum number of turns |
PKDD
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. The paradigm of pattern discovery based on constraints was introduced with the aim of providing to the user a tool to drive the discovery process towards potentially inte...
PPOPP
2011
ACM
12 years 10 months ago
2011
ACM
The sparse grid discretization technique enables a compressed representation of higher-dimensional functions. In its original form, it relies heavily on recursion and complex data...
IDA
2002
Springer
13 years 7 months ago
2002
Springer
Recently we presented a new approach [20] to the classification problem arising in data mining. It is based on the regularization network approach but in contrast to other methods...
WEA
2010
Springer
14 years 2 months ago
2010
Springer
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...
ICML
2009
IEEE
14 years 8 months ago
2009
IEEE
Practical data mining rarely falls exactly into the supervised learning scenario. Rather, the growing amount of unlabeled data poses a big challenge to large-scale semi-supervised...