13306 search results - page 320 / 2662 » Theoretical Computer Science |
195
click to vote
STACS
2010
Springer
16 years 2 months ago
2010
Springer
In this paper we consider the problem of reconstructing a hidden weighted
hypergraph of constant rank using additive queries. We prove the following: Let G be
a weighted hidden h...
161
click to vote
ACSC
2002
IEEE
16 years 7 days ago
2002
IEEE
We show how frequently occurring sequential patterns may be found from large datasets by first inducing a finite state automaton model describing the data, and then querying the m...
195
click to vote
SPIN
1999
Springer
15 years 11 months ago
1999
Springer
In a recent study a series of model checkers, among which Spin [5], SMV [9], and a newer system called XMC [10], were compared on performance. The measurements used for this compar...
233
click to vote
TCS
1998
15 years 7 months ago
1998
A method is described for proving “always possibly” properties of specifications in formalisms with linear-time trace semantics. It is shown to be relatively complete for TLA...
172
click to vote
HICSS
2009
IEEE
16 years 2 months ago
2009
IEEE
A simple theoretical framework is developed to evaluate the security and usability of eavesdroppingresistant authentication schemes. Such schemes strive to allow users to authenti...