9842 search results - page 1279 / 1969 » The Complexity of the Matching-Cut Problem |
186
click to vote
KDD
2008
ACM
16 years 7 months ago
2008
ACM
Classic mixture models assume that the prevalence of the various mixture components is fixed and does not vary over time. This presents problems for applications where the goal is...
198
Voted
CHI
2001
ACM
16 years 7 months ago
2001
ACM
A growing social problem in the U.S., and elsewhere, is supporting older adults who want to continue living independently, as opposed to moving to an institutional care setting. O...
222
click to vote
STOC
2006
ACM
16 years 7 months ago
2006
ACM
It is proved that several interactive proof systems are zero-knowledge against general quantum attacks. This includes the Goldreich?Micali?Wigderson classical zero-knowledge proto...
152
click to vote
STOC
2005
ACM
16 years 7 months ago
2005
ACM
We present a deterministic, log-space algorithm that solves st-connectivity in undirected graphs. The previous bound on the space complexity of undirected st-connectivity was log4...
184
click to vote
STOC
2005
ACM
16 years 7 months ago
2005
ACM
We continue the study of amplification of average-case complexity within NP, and we focus on the uniform case. We prove that if every problem in NP admits an efficient uniform alg...