Sciweavers

1511 search results - page 134 / 303
» Randomness, lowness and degrees
Sort
View
STOC
2000
ACM
117views Algorithms» more  STOC 2000»
15 years 10 months ago
Faster suffix tree construction with missing suffix links
Abstract. We consider suffix tree construction for situations with missing suffix links. Two examples of such situations are suffix trees for parameterized strings and suffix trees...
Richard Cole, Ramesh Hariharan
SDM
2007
SIAM
171views Data Mining» more  SDM 2007»
15 years 7 months ago
A Better Alternative to Piecewise Linear Time Series Segmentation
Time series are difficult to monitor, summarize and predict. Segmentation organizes time series into few intervals having uniform characteristics (flatness, linearity, modality,...
Daniel Lemire
MASCOTS
2001
15 years 7 months ago
Large-Scale Simulation of Replica Placement Algorithms for a Serverless Distributed File System
Farsite is a scalable, distributed file system that logically functions as a centralized file server but that is physically implemented on a set of client desktop computers. Farsi...
John R. Douceur, Roger Wattenhofer
CEC
2010
IEEE
15 years 7 months ago
On the role of modularity in evolutionary dynamic optimisation
The field of evolutionary dynamic optimisation is concerned with the application of evolutionary algorithms to dynamic optimisation problems. In recent years, numerous new algorith...
Philipp Rohlfshagen, Xin Yao
ML
2006
ACM
121views Machine Learning» more  ML 2006»
15 years 6 months ago
Model-based transductive learning of the kernel matrix
This paper addresses the problem of transductive learning of the kernel matrix from a probabilistic perspective. We define the kernel matrix as a Wishart process prior and construc...
Zhihua Zhang, James T. Kwok, Dit-Yan Yeung