Sciweavers

2620 search results - page 34 / 524
» An Evaluation Technique for Binarization Algorithms
Sort
View
ASE
2005
137views more  ASE 2005»
13 years 7 months ago
Rewriting-Based Techniques for Runtime Verification
Techniques for efficiently evaluating future time Linear Temporal Logic (abbreviated LTL) formulae on finite execution traces are presented. While the standard models of LTL are i...
Grigore Rosu, Klaus Havelund
DIALM
2004
ACM
124views Algorithms» more  DIALM 2004»
14 years 1 months ago
Localized techniques for broadcasting in wireless sensor networks
We present three localized techniques for broadcasting in large scale ad hoc networks, i.e., for the problem of disseminating a message from a source node to all the nodes in the ...
Lorenzo Orecchia, Alessandro Panconesi, Chiara Pet...
CHI
2002
ACM
14 years 8 months ago
Quantitative analysis of scrolling techniques
We propose a formal experimental paradigm designed to help evaluate scrolling interaction techniques. Such a method is needed by interaction designers to quantify scrolling perfor...
Ken Hinckley, Edward Cutrell, Steve Bathiche, Tim ...
SIGMOD
2007
ACM
186views Database» more  SIGMOD 2007»
14 years 8 months ago
An efficient and accurate method for evaluating time series similarity
A variety of techniques currently exist for measuring the similarity between time series datasets. Of these techniques, the methods whose matching criteria is bounded by a specifi...
Michael D. Morse, Jignesh M. Patel
ATVA
2008
Springer
102views Hardware» more  ATVA 2008»
13 years 9 months ago
Time-Progress Evaluation for Dense-Time Automata with Concave Path Conditions
The evaluation of successor or predecessor state spaces through time progress is a central component in the model-checking algorithm of dense-time automata. The definition of the t...
Farn Wang