2661 search results - page 269 / 533 » Quantum Complexity Classes |
136
Voted
JCSS
2000
15 years 3 months ago
2000
It is a well-known result of Fagin that the complexity class NP coincides with the class of problems expressible in existential second-order logic ( 1 1), which allows sentences c...
159
click to vote
TC
2010
14 years 11 months ago
2010
In this paper, we define and study a new class of capacity planning models called MAP queueing networks. MAP queueing networks provide the first analytical methodology to describe ...
255
Voted
Book
"This book has evolved from materials used in an undergraduate course intended for final year undergraduate students whose background includes at least one year's experie...
138
click to vote
DAC
2003
ACM
16 years 5 months ago
2003
ACM
The use of Support Vector Machines (SVMs) to represent the performance space of analog circuits is explored. In abstract terms, an analog circuit maps a set of input design parame...
145
click to vote
KDD
2002
ACM
16 years 4 months ago
2002
ACM
Support vector machines (SVMs) excel at two-class discriminative learning problems. They often outperform generative classifiers, especially those that use inaccurate generative m...