Sciweavers

4850 search results - page 401 / 970
» Approximate Data Structures with Applications
Sort
View
LSSC
2001
Springer
15 years 11 months ago
On the Parallelization of the Sparse Grid Approach for Data Mining
Abstract. Recently we presented a new approach [5, 6] to the classification problem arising in data mining. It is based on the regularization network approach, but in contrast to ...
Jochen Garcke, Michael Griebel
COMCOM
2006
147views more  COMCOM 2006»
15 years 6 months ago
Coverage-adaptive random sensor scheduling for application-aware data gathering in wireless sensor networks
Due to the application-specific nature of wireless sensor networks, application-aware algorithm and protocol design paradigms are highly required in order to optimize the overall ...
Wook Choi, Sajal K. Das
CPHYSICS
2007
89views more  CPHYSICS 2007»
15 years 6 months ago
Numerical differentiation of experimental data: local versus global methods
In the context of the analysis of measured data, one is often faced with the task to differentiate data numerically. Typically, this occurs when measured data are concerned or dat...
Karsten Ahnert, Markus Abel
ICDE
2006
IEEE
158views Database» more  ICDE 2006»
16 years 8 months ago
Space-efficient Relative Error Order Sketch over Data Streams
We consider the problem of continuously maintaining order sketches over data streams with a relative rank error guarantee . Novel space-efficient and one-scan randomised technique...
Ying Zhang, Xuemin Lin, Jian Xu, Flip Korn, Wei Wa...
KDD
2004
ACM
173views Data Mining» more  KDD 2004»
16 years 7 months ago
A microeconomic data mining problem: customer-oriented catalog segmentation
The microeconomic framework for data mining [7] assumes that an enterprise chooses a decision maximizing the overall utility over all customers where the contribution of a custome...
Martin Ester, Rong Ge, Wen Jin, Zengjian Hu