Sciweavers

230 search results - page 20 / 46
» Experiments with Improved Approximate Mean Value Analysis Al...
Sort
View
STOC
2004
ACM
61views Algorithms» more  STOC 2004»
14 years 8 months ago
The zero-one principle for switching networks
Recently, approximation analysis has been extensively used to study algorithms for routing weighted packets in various network settings. Although different techniques were applied...
Yossi Azar, Yossi Richter
DATAMINE
2006
176views more  DATAMINE 2006»
13 years 7 months ago
A Bit Level Representation for Time Series Data Mining with Shape Based Similarity
Clipping is the process of transforming a real valued series into a sequence of bits representing whether each data is above or below the average. In this paper, we argue that clip...
Anthony J. Bagnall, Chotirat (Ann) Ratanamahatana,...
SIGMOD
2008
ACM
236views Database» more  SIGMOD 2008»
14 years 7 months ago
Approximate embedding-based subsequence matching of time series
A method for approximate subsequence matching is introduced, that significantly improves the efficiency of subsequence matching in large time series data sets under the dynamic ti...
Vassilis Athitsos, Panagiotis Papapetrou, Michalis...
AAAI
1997
13 years 9 months ago
Effective Redundant Constraints for Online Scheduling
The use of heuristics as a means to improve constraint solver performance has been researched widely. However, most work has been on problem-independentheuristics (e.g., variable ...
Lise Getoor, Greger Ottosson, Markus P. J. Fromher...
ICPR
2010
IEEE
13 years 11 months ago
A Hypothesis Testing Approach for Fluorescent Blob Identification
Template matching is a common approach for identifying fluorescent objects within a biological image. But how to decide a threshold value for the purpose of justifying the goodness...
Le-Shin Wu, Sidney Shaw