587 search results - page 32 / 118 » On the Relative Sizes of Learnable Sets |
81
Voted
FM
2001
Springer
15 years 2 months ago
2001
Springer
To develop efficient algorithms for the reachability analysis of timed automata, a promising approach is to use binary decision diagrams (BDDs) as data structure for the representa...
ASPDAC
1998
ACM
15 years 1 months ago
1998
ACM
— Test Pattern Generation for combinational circuits entails the identification of primary input assignments for detecting each fault in a set of target faults. An extension to ...
100
click to vote
TON
2008
14 years 9 months ago
2008
We study the problem of load balancing the traffic from a set of unicast and multicast sessions. The problem is formulated as an optimization problem. However, we assume that the g...
SPIRE
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. We consider fingerprinting methods for collaborative filtering (CF) systems. In general, CF systems show their real strength when supplied with enormous data sets. Earl...
FPL
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. This paper focuses on a class of problem relating to the multiplication of a single number by several coefficients that, while not constant, are drawn from a finite set ...