Sciweavers

1920 search results - page 277 / 384
» The Complexity of the A B C Problem
Sort
View
PODC
2009
ACM
14 years 9 months ago
A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
Peer-to-peer systems rely on scalable overlay networks that enable efficient routing between its members. Hypercubic topologies facilitate such operations while each node only nee...
Riko Jacob, Andréa W. Richa, Christian Sche...
VLDB
2005
ACM
153views Database» more  VLDB 2005»
14 years 9 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
2008
ACM
129views Database» more  SIGMOD 2008»
14 years 9 months ago
An xml index advisor for DB2
XML database systems are expected to handle increasingly complex queries over increasingly large and highly structured XML databases. An important problem that needs to be solved ...
Iman Elghandour, Ashraf Aboulnaga, Daniel C. Zilio...
SIGMOD
2001
ACM
142views Database» more  SIGMOD 2001»
14 years 9 months ago
Outlier Detection for High Dimensional Data
The outlier detection problem has important applications in the eld of fraud detection, network robustness analysis, and intrusion detection. Most such applications are high dimen...
Charu C. Aggarwal, Philip S. Yu
MOBIHOC
2008
ACM
14 years 8 months ago
Optimal relay assignment for cooperative communications
Recently, cooperative communications, in the form of keeping each node with a single antenna and having a node exploit a relay node's antenna, is shown to be a promising appr...
Yi Shi, Sushant Sharma, Y. Thomas Hou, Sastry Komp...