Sciweavers

4378 search results - page 520 / 876
» On the Complexity of Ordered Colourings
Sort
View
VLDB
2005
ACM
153views Database» more  VLDB 2005»
16 years 7 months ago
An effective and efficient algorithm for high-dimensional outlier detection
Abstract. The outlier detection problem has important applications in the field of fraud detection, network robustness analysis, and intrusion detection. Most such applications are...
Charu C. Aggarwal, Philip S. Yu
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
16 years 7 months ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang
SIGMOD
2006
ACM
150views Database» more  SIGMOD 2006»
16 years 7 months ago
On-the-fly sharing for streamed aggregation
Data streaming systems are becoming essential for monitoring applications such as financial analysis and network intrusion detection. These systems often have to process many simi...
Sailesh Krishnamurthy, Chung Wu, Michael J. Frankl...
SIGMOD
2005
ACM
107views Database» more  SIGMOD 2005»
16 years 7 months ago
Goals and Benchmarks for Autonomic Configuration Recommenders
We are witnessing an explosive increase in the complexity of the information systems we rely upon. Autonomic systems address this challenge by continuously configuring and tuning ...
Mariano P. Consens, Denilson Barbosa, Adrian M. Te...
SIGMOD
2004
ACM
154views Database» more  SIGMOD 2004»
16 years 7 months ago
Compressing Historical Information in Sensor Networks
We are inevitably moving into a realm where small and inexpensive wireless devices would be seamlessly embedded in the physical world and form a wireless sensor network in order t...
Antonios Deligiannakis, Yannis Kotidis, Nick Rouss...