Sciweavers

7971 search results - page 1253 / 1595
» On unbounded operators and applications
Sort
View
KDD
2004
ACM
157views Data Mining» more  KDD 2004»
16 years 4 days ago
Fast mining of spatial collocations
Spatial collocation patterns associate the co-existence of nonspatial features in a spatial neighborhood. An example of such a pattern can associate contaminated water reservoirs ...
Xin Zhang, Nikos Mamoulis, David W. Cheung, Yutao ...
KDD
2004
ACM
159views Data Mining» more  KDD 2004»
16 years 4 days ago
Optimal randomization for privacy preserving data mining
Randomization is an economical and efficient approach for privacy preserving data mining (PPDM). In order to guarantee the performance of data mining and the protection of individ...
Michael Yu Zhu, Lei Liu
KR
2004
Springer
16 years 4 days ago
Reasoning about Knowledge by Variable Forgetting
In this paper, we investigate knowledge reasoning within a simple framework called knowledge structure. We use variable forgetting as a basic operation for one agent to reason abo...
Kaile Su, Guanfeng Lv, Yan Zhang
LCTRTS
2004
Springer
16 years 4 days ago
Generating fast code from concurrent program dependence graphs
While concurrency in embedded systems is most often supplied by real-time operating systems, this approach can be unpredictable and difficult to debug. Synchronous concurrency, i...
Jia Zeng, Cristian Soviani, Stephen A. Edwards
MIDDLEWARE
2004
Springer
16 years 4 days ago
On the benefits of decomposing policy engines into components
In order for middleware systems to be adaptive, their properties and services need to support a wide variety of application-specific policies. However, application developers and ...
Konstantin Beznosov
« Prev « First page 1253 / 1595 Last » Next »