1566 search results - page 213 / 314 » On a Cone Covering Problem |
139
click to vote
ICML
2008
IEEE
16 years 5 months ago
2008
IEEE
In high-dimensional classification problems it is infeasible to include enough training samples to cover the class regions densely. Irregularities in the resulting sparse sample d...
119
click to vote
CAV
2009
Springer
16 years 4 months ago
2009
Springer
Abstract. We study the problem of determining, given a run of a concurrent program, whether there is any alternate execution of it that violates atomicity, where atomicity is defin...
115
click to vote
STOC
2003
ACM
16 years 4 months ago
2003
ACM
In this paper, we present the first average-case analysis proving an expected polynomial running time for an exact algorithm for the 0/1 knapsack problem. In particular, we prove,...
119
click to vote
ICCAD
2002
IEEE
16 years 1 months ago
2002
IEEE
In macromodeling-based power estimation, circuit macromodels are created from simulations of synthetic input vector sequences. Fast generation of these sequences with all possible...
130
click to vote
IUI
2010
ACM
16 years 1 months ago
2010
ACM
One of the critical problems in natural language interfaces is the discordance between the expressions covered by the interface and those by the knowledge base. In the graph-based...