MANEGOLD S,BONCZ P,KERSTEN M L.Generic database cost models for hierarchical memory systems[C]// Proceedings of 28th International conference on Very Large Data Bases(VLDB'02).Hong Kong:[s.n.],2002:191-202.Mane
The new orthogonal feature space often produces a better fit for conventional machine learning algorithms to learn accurate classifiers, compared to the ones learned from the original feature space. However, such feature extraction process does not consider temporal or spatial correlation of the data, ...
Computer Science - Data Structures and AlgorithmsA string matching -- and more generally, sequence matching -- algorithm is presented that has a linear worst-case computing time bound, a low worst-case bound on the number of comparisons (2n), and sublinear average-case behavior that is better...
In a statically-typed language, overloads dispatch based on data types, and in an ideal world, on what concepts they model. In a well-designed generic program in a statically-typed language you have high level generic algorithms built around smaller and smaller algorithms, each operating on mo...
ACOLITE combines the atmospheric correction algorithms for aquatic applications of various satellite missions developed at RBINS. This repository hosts the (more) generic version of ACOLITE with the aim of bringing together the processing of all different sensors. This new generic version was started ...
Scoring methods based on machine learning have made substantial progress with the explosive growth of experimental protein–ligand interaction data. Various machine learning algorithms and neural network architectures, such as three-dimensional convolutional neural networks10,11and graph convolutional neural net...
A distinctive feature of the library is that all supported meshes inherit from a unique base class that implements their common traits, permitting to deploy algorithms that operate onabstractmeshes that may be any of the above. This allows to implement algorithms just once and run the same code...
In fact, several ER algorithms [2,15] have used hash-based data structures during the computation of similarities to speed up the match process to some extent. Detective Gadget pushes this idea to the extreme: differently from previous approaches that mix similarity computations and hashing, we ...
Data Fusion Algorithms for Multiple Inertial Measurement Units. Sensors 2011, 11, 6771–6798. [Google Scholar] [CrossRef] [PubMed] Wang, T.; Li, K.; Luo, H.; Zhong, S. Improving the Measurement Accuracy of the MEMS IMU Array by a New Calibration and Fusion Technology. IEEE Sens. J....
His research focuses on all aspects of search technology, ranging from low-level algorithms for index compression to human–computer interaction issues in web search. Rose led the team at Apple that created desktop search for the Macintosh. He holds a Ph.D. in cognitive science and computer ...