994 search results - page 134 / 199 » Custom Computing Machines for the Set Covering Problem |
ICONS
2008
IEEE
15 years 7 months ago
2008
IEEE
With the increasing interest in developing pervasive computing technologies there is growing recognition of the problems of maintaining user privacy. In the Daidalos pervasive sys...
83
Voted
KDD
2004
ACM
16 years 28 days ago
2004
ACM
Frequent itemset mining has been the subject of a lot of work in data mining research ever since association rules were introduced. In this paper we address a problem with frequen...
129
click to vote
FSTTCS
1992
Springer
15 years 4 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...
115
Voted
IWPEC
2009
Springer
15 years 7 months ago
2009
Springer
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions, such that each partition induces a connected sub...
95
Voted
JUCS
2007
15 years 12 days ago
2007
: This paper describes a method of using Petri net P-invariants in system diagnosis. To model this process a net oriented fault classification is presented. Hence, the considered d...