2446 search results - page 147 / 490 » Choiceless Polynomial Time |
145
click to vote
COLT
1993
Springer
15 years 5 months ago
1993
Springer
The Vapnik-Chervonenkis (V-C) dimension is an important combinatorial tool in the analysis of learning problems in the PAC framework. For polynomial learnability, we seek upper bou...
206
Voted
ICDT
2009
ACM
16 years 1 months ago
2009
ACM
The class of unions of conjunctive queries (UCQ) has been shown to be particularly well-behaved for data exchange; its certain answers can be computed in polynomial time (in terms...
139
click to vote
MOBICOM
2006
ACM
15 years 6 months ago
2006
ACM
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
115
click to vote
CSB
2005
IEEE
15 years 6 months ago
2005
IEEE
Our paper describes the first provably-efficient algorithm for determining protein structures de novo, solely from experimental data. We show how the global nature of a certain ...
96
Voted
SIGECOM
2005
ACM
15 years 6 months ago
2005
ACM
We study various computational aspects of solving games using dominance and iterated dominance. We first study both strict and weak dominance (not iterated), and show that checki...