1040 search results - page 103 / 208 » Rounding algorithms for covering problems |
115
click to vote
IJFCS
2008
14 years 10 months ago
2008
A fundamental problem in music is to classify songs according to their rhythm. A rhythm is represented by a sequence of "Quick" (Q) and "Slow" (S) symbols, whi...
WOB
2003
14 years 11 months ago
2003
The maximum subsequence problem finds the contiguous subsequence of n real numbers with the highest sum. This is an important problem that arises in several contexts in Computatio...
120
click to vote
TCC
2007
Springer
15 years 4 months ago
2007
Springer
In this work we present secure two-party protocols for various core problems in linear algebra. Our main result is a protocol to obliviously decide singularity of an encrypted matr...
CPM
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. We address in this paper a new computational biology problem that aims at understanding a mechanism that could potentially be used to genetically manipulate natural insec...
COLT
2005
Springer
15 years 3 months ago
2005
Springer
We consider the problem of learning a hypergraph using edge-detecting queries. In this model, the learner may query whether a set of vertices induces an edge of the hidden hypergr...