Sciweavers

2583 search results - page 91 / 517
» On the Representation of Timed Polyhedra
Sort
View
ARTS
1997
Springer
15 years 1 months ago
The Verus Language: Representing Time Efficiently with BDDs
There have been significant advances on formal methods to verify complex systems recently. Nevertheless, these methods have not yet been accepted as a realistic alternative to the ...
Sérgio Vale Aguiar Campos, Edmund M. Clarke
FOCM
2010
140views more  FOCM 2010»
14 years 8 months ago
Combinatorial Sublinear-Time Fourier Algorithms
We study the problem of estimating the best k term Fourier representation for a given frequency-sparse signal (i.e., vector) A of length N k. More explicitly, we investigate how t...
Mark A. Iwen
STOC
2003
ACM
178views Algorithms» more  STOC 2003»
15 years 10 months ago
Uniform hashing in constant time and linear space
Many algorithms and data structures employing hashing have been analyzed under the uniform hashing assumption, i.e., the assumption that hash functions behave like truly random fu...
Anna Östlin, Rasmus Pagh
AIME
2005
Springer
15 years 3 months ago
Ontology of Time and Situoids in Medical Conceptual Modeling
Time, events, changes, and processes play a major role in medical conceptual modeling. Representation of time-structures and reasoning about time-oriented medical data are importan...
Heinrich Herre, Barbara Heller
CSR
2006
Springer
15 years 1 months ago
All Semi-local Longest Common Subsequences in Subquadratic Time
For two strings a, b of lengths m, n respectively, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In this paper, w...
Alexandre Tiskin