16404 search results - page 787 / 3281 » A set coverage problem |
214
click to vote
SDM
2008
SIAM
15 years 9 months ago
2008
SIAM
Most clustering algorithms produce a single clustering for a given data set even when the data can be clustered naturally in multiple ways. In this paper, we address the difficult...
240
click to vote
FSTTCS
1992
Springer
15 years 11 months ago
1992
Springer
Levin introduced an average-case complexity measure, based on a notion of \polynomialon average," and de ned \average-case polynomial-time many-one reducibility" amongra...
186
click to vote
CORR
2007
Springer
15 years 7 months ago
2007
Springer
We consider qualitative and quantitative verification problems for infinite-state Markov chains. We call a Markov chain decisive w.r.t. a given set of target states F if it almos...
224
click to vote
ICML
2003
IEEE
16 years 8 months ago
2003
IEEE
Many techniques in the social sciences and graph theory deal with the problem of examining and analyzing patterns found in the underlying structure and associations of a group of ...
176
click to vote
INFOCOM
2009
IEEE
16 years 2 months ago
2009
IEEE
—Packet classification is a function increasingly used in a number of networking appliances and applications. Typically, sists of a set of abstract classifications, and a set o...