450 search results - page 54 / 90 » The Complexity of Computing Minimal Unidirectional Covering ... |
KDD
2001
ACM
16 years 7 days ago
2001
ACM
This paper considers the framework of the so-called "market basket problem", in which a database of transactions is mined for the occurrence of unusually frequent item s...
103
click to vote
AI
2008
Springer
14 years 12 months ago
2008
Springer
Verification of reachability properties for probabilistic systems is usually based on variants of Markov processes. Current methods assume an exact model of the dynamic behavior a...
122
click to vote
GLOBECOM
2009
IEEE
14 years 9 months ago
2009
IEEE
Abstract--We consider a set of multicast sources, each multicasting a finite amount of data to its corresponding destinations. The objective is to minimize the time to deliver all ...
192
click to vote
ICDE
2007
IEEE
16 years 1 months ago
2007
IEEE
We consider the problem of repairing a database that is inconsistent wrt a set of integrity constraints by updating numerical values. In particular, we concentrate on denial integ...
109
click to vote
DAC
1997
ACM
15 years 4 months ago
1997
ACM
We present a system-level approach for power optimization under a set of user specified costs and timing constraints of hard real-time designs. The approach optimizes all three d...