Sciweavers

5877 search results - page 135 / 1176
» Advanced High Performance Algorithms for Data Processing
Sort
View
ICDE
2008
IEEE
159views Database» more  ICDE 2008»
16 years 6 months ago
Fast Graph Pattern Matching
Due to rapid growth of the Internet technology and new scientific/technological advances, the number of applications that model data as graphs increases, because graphs have high e...
Jiefeng Cheng, Jeffrey Xu Yu, Bolin Ding, Philip S...
IPSN
2010
Springer
15 years 11 months ago
Lakon: a middle-ground approach to high-frequency data acquisition and in-network processing in sensor networks
The need for high-frequency signal acquisition and processing is becoming increasingly prevalent in sensor networks. Applications that require high-frequency data sampling are pre...
Prashanth G. Reddy, Nigamanth Sridhar
ECUMN
2004
Springer
15 years 10 months ago
Fairness Property and TCP-Level Performance of Unified Scheduling Algorithm in HSDPA Networks
- Channel-state-aware scheduling strategies on wireless links play an essential role for enhancing throughput performance of elastic data traffic by exploiting channel fluctuatio...
Yoshiaki Ohta, Masato Tsuru, Yuji Oie
VLDB
1999
ACM
224views Database» more  VLDB 1999»
15 years 9 months ago
Optimal Grid-Clustering: Towards Breaking the Curse of Dimensionality in High-Dimensional Clustering
Many applications require the clustering of large amounts of high-dimensional data. Most clustering algorithms, however, do not work e ectively and e ciently in highdimensional sp...
Alexander Hinneburg, Daniel A. Keim
DMKD
1997
ACM
308views Data Mining» more  DMKD 1997»
15 years 9 months ago
A Fast Clustering Algorithm to Cluster Very Large Categorical Data Sets in Data Mining
Partitioning a large set of objects into homogeneous clusters is a fundamental operation in data mining. The k-means algorithm is best suited for implementing this operation becau...
Zhexue Huang