2430 search results - page 342 / 486 » Computing Tutte Polynomials |
121
Voted
MST
1998
15 years 3 months ago
1998
We de ne the sharply bounded hierarchy, SBH(QL), a hierarchy of classes within P, using quasilinear-time computation and quanti cation over strings of length logn. It generalizes ...
143
Voted
ML
2007
ACM
15 years 3 months ago
2007
ACM
We prove new lower bounds for learning intersections of halfspaces, one of the most important concept classes in computational learning theory. Our main result is that any statist...
192
Voted
PAIRING
2010
Springer
15 years 1 months ago
2010
Springer
This paper describes the design of a fast software library for the computation of the optimal ate pairing on a Barreto–Naehrig elliptic curve. Our library is able to compute the ...
108
click to vote
PERCOM
2010
ACM
15 years 1 months ago
2010
ACM
Abstract—Choosing the right feature for motion based activity spotting is not a trivial task. Often, features derived by intuition or that proved to work well in previous work ar...
139
Voted
TCS
2010
15 years 1 months ago
2010
Abstract. We study a general class of non-cooperative games coming from combinatorial covering and facility location problems. A game for k players is based on an integer programmi...