Sciweavers

3934 search results - page 245 / 787
» Approximate Schedulability Analysis
Sort
View
IS
2008
15 years 6 months ago
A dimensionality reduction technique for efficient time series similarity analysis
We propose a dimensionality reduction technique for time series analysis that significantly improves the efficiency and accuracy of similarity searches. In contrast to piecewise c...
Qiang Wang, Vasileios Megalooikonomou
PE
2007
Springer
164views Optimization» more  PE 2007»
15 years 6 months ago
Analysis of join-the-shortest-queue routing for web server farms
Join the Shortest Queue (JSQ) is a popular routing policy for server farms. However, until now all analysis of JSQ has been limited to First-Come-First-Serve (FCFS) server farms, ...
Varun Gupta, Mor Harchol-Balter, Karl Sigman, Ward...
PODS
2008
ACM
159views Database» more  PODS 2008»
16 years 6 months ago
Approximation algorithms for clustering uncertain data
There is an increasing quantity of data with uncertainty arising from applications such as sensor network measurements, record linkage, and as output of mining algorithms. This un...
Graham Cormode, Andrew McGregor
IMA
2007
Springer
97views Cryptology» more  IMA 2007»
16 years 21 days ago
Non-linear Cryptanalysis Revisited: Heuristic Search for Approximations to S-Boxes
Non-linear cryptanalysis is a natural extension to Matsui’s linear cryptanalitic techniques in which linear approximations are replaced by nonlinear expressions. Non-linear appro...
Juan M. Estévez-Tapiador, John A. Clark, Ju...
STOC
2010
ACM
261views Algorithms» more  STOC 2010»
15 years 11 months ago
An Improved LP-based Approximation for Steiner Tree
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
Jaroslaw Byrka, Fabrizio Grandoni, Thomas Rothvoss...