Sciweavers

201 search results - page 33 / 41
» Rough Set Approximation Based on Dynamic Granulation
Sort
View
ICASSP
2011
IEEE
13 years 10 days ago
Predictive modeling of the spatiotemporal evolution of an environmental hazard and its sensor network implementation
Predicting accurately the spatiotemporal evolution of a diffusive environmental hazard is of paramount importance for its effective containment. We approximate the front line of a...
Dimitris V. Manatakis, Elias S. Manolakos
DMSN
2007
ACM
14 years 16 days ago
Similarity-aware query allocation in sensor networks with multiple base stations
In this paper, we consider a large scale sensor network comprising multiple, say K, base stations and a large number of wireless sensors. Such an infrastructure is expected to be ...
Shili Xiang, Hock-Beng Lim, Kian-Lee Tan, Yongluan...
DATAMINE
2006
176views more  DATAMINE 2006»
13 years 8 months ago
A Bit Level Representation for Time Series Data Mining with Shape Based Similarity
Clipping is the process of transforming a real valued series into a sequence of bits representing whether each data is above or below the average. In this paper, we argue that clip...
Anthony J. Bagnall, Chotirat (Ann) Ratanamahatana,...
PODS
2002
ACM
138views Database» more  PODS 2002»
14 years 8 months ago
Fast Algorithms For Hierarchical Range Histogram Construction
Data Warehousing and OLAPapplications typically view data as having multiple logical dimensions e.g., product, location with natural hierarchies de ned on each dimension. OLAP que...
Sudipto Guha, Nick Koudas, Divesh Srivastava
ESA
2003
Springer
111views Algorithms» more  ESA 2003»
14 years 1 months ago
Fast Smallest-Enclosing-Ball Computation in High Dimensions
Abstract. We develop a simple combinatorial algorithm for computing the smallest enclosing ball of a set of points in high dimensional Euclidean space. The resulting code is in mos...
Kaspar Fischer, Bernd Gärtner, Martin Kutz