Sciweavers

18306 search results - page 163 / 3662
» Algorithmics in Exponential Time
Sort
View
FORMATS
2005
Springer
15 years 7 months ago
Diagonal Constraints in Timed Automata: Forward Analysis of Timed Systems
Timed automata (TA) are a widely used model for real-time systems. Several tools are dedicated to this model, and they mostly implement a forward analysis for checking reachability...
Patricia Bouyer, François Laroussinie, Pier...
JBI
2004
171views Bioinformatics» more  JBI 2004»
15 years 3 months ago
Consensus Clustering and Functional Interpretation of Gene Expression Data
Microarray analysis using clustering algorithms can suffer from lack of inter-method consistency in assigning related gene-expression profiles to clusters. Obtaining a consensus s...
Paul Kellam, Stephen Swift, Allan Tucker, Veronica...
WISA
2005
Springer
15 years 7 months ago
DPA Attack on the Improved Ha-Moon Algorithm
Abstract. The algorithm proposed by Ha and Moon [2] is a countermeasure against power analysis. The Ha-Moon algorithm has two drawbacks in that it requires an inversion and has a r...
Jong Hoon Shin, Dong Jin Park, Pil Joong Lee
111
Voted
AAAI
1997
15 years 3 months ago
Worst-Case Absolute Loss Bounds for Linear Learning Algorithms
The absolute loss is the absolute difference between the desired and predicted outcome. I demonstrateworst-case upper bounds on the absolute loss for the perceptron algorithm and ...
Tom Bylander
135
Voted
SSDBM
2007
IEEE
127views Database» more  SSDBM 2007»
15 years 8 months ago
A Fast Algorithm for Approximate Quantiles in High Speed Data Streams
We present a fast algorithm for computing approximate quantiles in high speed data streams with deterministic error bounds. For data streams of size N where N is unknown in advanc...
Qi Zhang, Wei Wang 0010