Sciweavers

6365 search results - page 166 / 1273
» Fast Local Computation Algorithms
Sort
View
KDD
1997
ACM
213views Data Mining» more  KDD 1997»
15 years 9 months ago
A Probabilistic Approach to Fast Pattern Matching in Time Series Databases
Theproblemof efficiently and accurately locating patterns of interest in massivetimeseries data sets is an important and non-trivial problemin a wide variety of applications, incl...
Eamonn J. Keogh, Padhraic Smyth
ICCS
2007
Springer
15 years 11 months ago
Local Link Protection Scheme in IP Networks
In this paper, we proposed an IP Local Link-Protection (IPLLP) scheme based on the characteristic of shortest-path routing in IP networks. Our scheme working in an intra-area routi...
Hui-Kai Su, Cheng-Shong Wu
EC
2008
157views ECommerce» more  EC 2008»
15 years 3 months ago
The Crowding Approach to Niching in Genetic Algorithms
A wide range of niching techniques have been investigated in evolutionary and genetic algorithms. In this article, we focus on niching using crowding techniques in the context of ...
Ole J. Mengshoel, David E. Goldberg
DAGM
2008
Springer
15 years 6 months ago
Sliding-Windows for Rapid Object Class Localization: A Parallel Technique
Abstract. This paper presents a fast object class localization framework implemented on a data parallel architecture currently available in recent computers. Our case study, the im...
Christian Wojek, Gyuri Dorkó, André ...
132
Voted
SPAA
1998
ACM
15 years 9 months ago
Fast Set Operations Using Treaps
We present parallel algorithms for union, intersection and difference on ordered sets using random balanced binary trees (treaps [26]). For two sets of size n and m (m ≤ n) the...
Guy E. Blelloch, Margaret Reid-Miller