510 search results - page 27 / 102 » Complexity measures and decision tree complexity: a survey |
TIT
1998
13 years 8 months ago
1998
—Upper and lower bounds are derived for the decoding complexity of a general lattice L. The bounds are in terms of the dimension n and the coding gain
of L, and are obtained ba...
IV
2009
IEEE
14 years 3 months ago
2009
IEEE
Aesthetics is an unsolved problem of information visualization, because there is no satisfactory understanding of what constitutes aesthetic effect. This survey paper gives an ove...
WDAG
2001
Springer
14 years 27 days ago
2001
Springer
Abstract. The ability to cooperate on common tasks in a distributed setting is key to solving a broad range of computation problems ranging from distributed search such as SETI to ...
PODS
2010
ACM
14 years 1 months ago
2010
ACM
XML Schema Definitions (XSDs) can be adequately abstracted by the single-type regular tree languages. It is wellknown, that these form a strict subclass of the robust class of re...
ICML
2004
IEEE
14 years 9 months ago
2004
IEEE
We introduce a framework, which we call Divide-by-2 (DB2), for extending support vector machines (SVM) to multi-class problems. DB2 offers an alternative to the standard one-again...