255 search results - page 26 / 51 » Spanning Trees and Function Classes |
138
click to vote
DOCENG
2006
ACM
15 years 11 months ago
2006
ACM
With the development of variable-data-driven digital presses where each document printed is potentially unique there is a need for pre-press optimization to identify material that...
191
Voted
GC
2008
Springer
15 years 5 months ago
2008
Springer
In this paper we study the class of weakly quasi-threshold graphs that are obtained from a vertex by recursively applying the operations (i) adding a new isolated vertex, (ii) addi...
153
Voted
IFL
1997
Springer
15 years 9 months ago
1997
Springer
Functional programs, by nature, operate on functional, or persistent, data structures. Therefore, persistent graphs are a prerequisite to express functional graph algorithms. In th...
163
click to vote
PAKDD
2010
ACM
15 years 10 months ago
2010
ACM
Abstract. Mining of data streams must balance three evaluation dimensions: accuracy, time and memory. Excellent accuracy on data streams has been obtained with Naive Bayes Hoeffdi...
174
click to vote
NIPS
1990
15 years 6 months ago
1990
A new class of data structures called "bumptrees" is described. These structures are useful for efficiently implementing a number of neural network related operations. A...