1798 search results - page 279 / 360 » A Tree for All Seasons |
MCS
2005
Springer
14 years 1 months ago
2005
Springer
A Half-Against-Half (HAH) multi-class SVM is proposed in this paper. Unlike the commonly used One-Against-All (OVA) and One-Against-One (OVO) implementation methods, HAH is built ...
OOPSLA
2005
Springer
14 years 1 months ago
2005
Springer
Io is small prototype-based programming language. The ideas in Io are mostly inspired by Smalltalk[1] (all values are objects), Self[2] (prototype-based), NewtonScript[3] (differe...
SPIRE
2005
Springer
14 years 1 months ago
2005
Springer
In-memory hash tables provide fast access to large numbers of strings, with less space overhead than sorted structures such as tries and binary trees. If chains are used for collis...
VLDB
2005
ACM
14 years 1 months ago
2005
ACM
Summarization of query results is an important problem for many OLAP applications. The Minimum Description Length principle has been applied in various studies to provide summarie...
WG
2005
Springer
14 years 1 months ago
2005
Springer
We prove that for all 0 ≤ t ≤ k and d ≥ 2k, every graph G with treewidth at most k has a ‘large’ induced subgraph H, where H has treewidth at most t and every vertex in ...