Sciweavers

2226 search results - page 363 / 446
» Scalable Trigger Processing
Sort
View
DMKD
1997
ACM
308views Data Mining» more  DMKD 1997»
15 years 10 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
ISMIS
1997
Springer
15 years 10 months ago
Knowledge-Based Image Retrieval with Spatial and Temporal Constructs
e about image features can be expressed as a hierarchical structure called a Type Abstraction Hierarchy (TAH). TAHs can be generated automatically by clustering algorithms based on...
Wesley W. Chu, Alfonso F. Cardenas, Ricky K. Taira
SIGCOMM
1996
ACM
15 years 10 months ago
A Channel Access Scheme for Large Dense Packet Radio Networks
Prior work in the eld of packet radio networks has often assumed a simple success-if-exclusive model of successful reception. This simple model is insucient to model interference...
Timothy J. Shepard
ICDE
2010
IEEE
290views Database» more  ICDE 2010»
15 years 10 months ago
The Model-Summary Problem and a Solution for Trees
Modern science is collecting massive amounts of data from sensors, instruments, and through computer simulation. It is widely believed that analysis of this data will hold the key ...
Biswanath Panda, Mirek Riedewald, Daniel Fink
IPPS
1994
IEEE
15 years 10 months ago
Shared Virtual Memory and Generalized Speedup
Generalized speedup is de ned as parallel speed over sequential speed. In this paper the generalized speedup and its relation with other existing performance metrics, such as trad...
Xian-He Sun, Jianping Zhu