3218 search results - page 325 / 644 » Timed Extensions for SDL |
188
click to vote
EDBT
2004
ACM
16 years 6 months ago
2004
ACM
Abstract. Hierarchical clustering has been proved an effective means for physically organizing large fact tables since it reduces significantly the I/O cost during ad hoc OLAP quer...
131
click to vote
EDBT
2008
ACM
16 years 6 months ago
2008
ACM
Index trees created using distance based indexing are difficult to maintain online since the distance function involved is often costly to compute. This problem is intensified whe...
171
click to vote
EWSN
2007
Springer
16 years 6 months ago
2007
Springer
Methods for node localisation in sensor networks usually rely upon the measurement of received strength, time-of-arrival, and/or angle-of-arrival of an incoming signal. In this pap...
188
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
We propose new succinct representations of ordinal trees, which have been studied extensively. It is known that any n-node static tree can be represented in 2n + o(n) bits and a l...
140
click to vote
SDM
2009
SIAM
16 years 3 months ago
2009
SIAM
Many different relative clustering validity criteria exist that are very useful in practice as quantitative measures for evaluating the quality of data partitions, and new criter...