4137 search results - page 491 / 828 » On the number of matchings of a tree |
158
click to vote
SOFSEM
1997
Springer
15 years 11 months ago
1997
Springer
: In this paper we rst present a general lower bound on the stabilization time which holds for a number of graph theoretic problems, including leader election, spanning tree constr...
199
click to vote
ECML
1993
Springer
15 years 11 months ago
1993
Springer
This paper describes a genetic learning system called SIA, which learns attributes based rules from a set of preclassified examples. Examples may be described with a variable numbe...
176
click to vote
FC
2010
Springer
15 years 10 months ago
2010
Springer
We present a new construction of divisible e-cash that makes use of 1) a new generation method of the binary tree of keys; 2) a new way of using bounded accumulators. The transacti...
199
click to vote
FCCM
2009
IEEE
15 years 10 months ago
2009
IEEE
Most high-speed Internet Protocol (IP) lookup implementations use tree traversal and pipelining. Due to the available on-chip memory and the number of I/O pins of Field Programmab...
206
click to vote
ICANNGA
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. The use of support vector machines for multi-category problems is still an open field to research. Most of the published works use the one-against-rest strategy, but with...