Sciweavers

4850 search results - page 83 / 970
» Approximate Data Structures with Applications
Sort
View
122
Voted
JMLR
2010
155views more  JMLR 2010»
14 years 11 months ago
Approximate Tree Kernels
Convolution kernels for trees provide simple means for learning with tree-structured data. The computation time of tree kernels is quadratic in the size of the trees, since all pa...
Konrad Rieck, Tammo Krueger, Ulf Brefeld, Klaus-Ro...
94
Voted
ADBIS
2010
Springer
145views Database» more  ADBIS 2010»
15 years 2 months ago
On Support of Ordering in Multidimensional Data Structures
Multidimensional data structures are applied in many areas, e.g. in data mining, indexing multimedia data and text documents, and so on. There are some applications where the range...
Filip Krizka, Michal Krátký, Radim B...
93
Voted
ICDM
2007
IEEE
106views Data Mining» more  ICDM 2007»
15 years 7 months ago
High-Speed Function Approximation
We address a new learning problem where the goal is to build a predictive model that minimizes prediction time (the time taken to make a prediction) subject to a constraint on mod...
Biswanath Panda, Mirek Riedewald, Johannes Gehrke,...
103
Voted
CORR
2010
Springer
153views Education» more  CORR 2010»
15 years 22 days ago
Multidimensional Data Structures and Techniques for Efficient Decision Making
: - In this paper we present several novel efficient techniques and multidimensional data structures which can improve the decision making process in many domains. We consider onli...
Madalina Ecaterina Andreica, Mugurel Ionut Andreic...
98
Voted
PPL
2008
99views more  PPL 2008»
15 years 17 days ago
A Modular Implementation of Data Structures in Bulk-Synchronous Parallel ML
A functional data-parallel language called BSML has been designed for programming Bulk-Synchronous Parallel algorithms. Many sequential algorithms do not have parallel counterpart...
Frédéric Gava