1383 search results - page 118 / 277 » On the Complexity of the Interlace Polynomial |
130
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
This paper presents computationally efficient implementations for Iterative Adaptive Approach (IAA) spectral estimation techniques for uniformly sampled data sets. By exploiting ...
158
click to vote
ICML
1996
IEEE
16 years 7 months ago
1996
IEEE
Within Valiant'smodel of learning as formalized by Kearns, we show that computable total predicates for two formallyuncomputable problems the classical Halting Problem, and t...
148
click to vote
GLOBECOM
2006
IEEE
16 years 12 days ago
2006
IEEE
— We address the problem of connection preemption in a multi-class network environment. Our objective is: i) to minimize the number of preempted connections, and ii) to minimize ...
158
click to vote
SIGECOM
2004
ACM
15 years 11 months ago
2004
ACM
We consider the parallels between the preference elicitation problem in combinatorial auctions and the problem of learning an unknown function from learning theory. We show that l...
159
click to vote
COCOON
1999
Springer
15 years 10 months ago
1999
Springer
Cai and Selman [CS99] defined a modification of Levin’s notion of average polynomial time and proved, for every P-bi-immune language L and every polynomial-time computable dis...