Sciweavers

921 search results - page 149 / 185
» New Data Structures for Orthogonal Range Searching
Sort
View
IPPS
2006
IEEE
15 years 10 months ago
Multiple sequence alignment by quantum genetic algorithm
In this paper we describe a new approach for the well known problem in bioinformatics: Multiple Sequence Alignment (MSA). MSA is fundamental task as it represents an essential pla...
L. Abdesslem, M. Soham, B. Mohamed
CPM
2006
Springer
182views Combinatorics» more  CPM 2006»
15 years 7 months ago
Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
The Range-Minimum-Query-Problem is to preprocess an array such that the position of the minimum element between two specified indices can be obtained efficiently. We present a dire...
Johannes Fischer, Volker Heun
129
Voted
SGAI
2007
Springer
15 years 10 months ago
Evolving a Dynamic Predictive Coding Mechanism for Novelty Detection
Novelty detection is a machine learning technique which identifies new or unknown information in large data sets. We present our current work on the construction of a new novelty...
Simon J. Haggett, Dominique F. Chu, Ian W. Marshal...
127
Voted
SOSP
2007
ACM
16 years 24 days ago
Improving file system reliability with I/O shepherding
We introduce a new reliability infrastructure for file systems called I/O shepherding. I/O shepherding allows a file system developer to craft nuanced reliability policies to de...
Haryadi S. Gunawi, Vijayan Prabhakaran, Swetha Kri...
UAI
2008
15 years 5 months ago
Flexible Priors for Exemplar-based Clustering
Exemplar-based clustering methods have been shown to produce state-of-the-art results on a number of synthetic and real-world clustering problems. They are appealing because they ...
Daniel Tarlow, Richard S. Zemel, Brendan J. Frey