8512 search results - page 163 / 1703 » Computing Theory With Relevance |
138
click to vote
PODS
2003
ACM
16 years 4 months ago
2003
ACM
Computing frequent itemsets and maximally frequent itemsets in a database are classic problems in data mining. The resource requirements of all extant algorithms for both problems...
150
click to vote
SAC
2010
ACM
15 years 11 months ago
2010
ACM
Analysis of systems containing both discrete and continuous dynamics, hybrid systems, is a difficult issue. Most problems have been shown to be undecidable in general, and decidab...
135
Voted
ISCC
2008
IEEE
15 years 11 months ago
2008
IEEE
We propose efficient scheduling algorithms for downlink MIMO-CDMA systems using zero forcing beamforming to achieve high system throughput with low computational complexity. Base...
183
click to vote
AIMS
2008
Springer
15 years 11 months ago
2008
Springer
We explore how fixed-point operators can be designed to interact and be composed to form autonomic control mechanisms. We depart from the idea that an operator is idempotent only ...
138
click to vote
NCA
2006
IEEE
15 years 10 months ago
2006
IEEE
Large-scale distributed systems, e.g., Grid or P2P networks, are targets for large-scale attacks. Unfortunately, few existing systems support propagation of alerts during the atta...