Sciweavers

512 search results - page 86 / 103
» On Evolutionary Optimization of Large Problems Using Small P...
Sort
View
108
Voted
EDBT
2010
ACM
152views Database» more  EDBT 2010»
15 years 3 months ago
Feedback-based annotation, selection and refinement of schema mappings for dataspaces
The specification of schema mappings has proved to be time and resource consuming, and has been recognized as a critical bottleneck to the large scale deployment of data integrati...
Khalid Belhajjame, Norman W. Paton, Suzanne M. Emb...
APPROX
2008
Springer
101views Algorithms» more  APPROX 2008»
15 years 2 months ago
Streaming Algorithms for k-Center Clustering with Outliers and with Anonymity
Clustering is a common problem in the analysis of large data sets. Streaming algorithms, which make a single pass over the data set using small working memory and produce a cluster...
Richard Matthew McCutchen, Samir Khuller
101
Voted
IJIT
2004
15 years 1 months ago
Modeling of Pulping of Sugar Maple Using Advanced Neural Network Learning
This paper reports work done to improve the modeling of complex processes when only small experimental data sets are available. Neural networks are used to capture the nonlinear un...
W. D. Wan Rosli, Z. Zainuddin, R. Lanouette, S. Sa...
98
Voted
IWANN
1999
Springer
15 years 4 months ago
Using Temporal Neighborhoods to Adapt Function Approximators in Reinforcement Learning
To avoid the curse of dimensionality, function approximators are used in reinforcement learning to learn value functions for individual states. In order to make better use of comp...
R. Matthew Kretchmar, Charles W. Anderson
102
Voted
ISCI
2008
116views more  ISCI 2008»
15 years 12 days ago
Discovery of maximum length frequent itemsets
The use of frequent itemsets has been limited by the high computational cost as well as the large number of resulting itemsets. In many real-world scenarios, however, it is often ...
Tianming Hu, Sam Yuan Sung, Hui Xiong, Qian Fu