Sciweavers

2060 search results - page 28 / 412
» Some Applications of Coding Theory in Computational Complexi...
Sort
View
71
Voted
MOC
1998
104views more  MOC 1998»
14 years 9 months ago
Chaos in the Lorenz equations: A computer assisted proof. Part II: Details
Abstract. Details of a new technique for obtaining rigorous results concerning the global dynamics of nonlinear systems is described. The technique abstract existence results based...
Konstantin Mischaikow, Marian Mrozek
90
Voted
CCS
2011
ACM
13 years 9 months ago
Policy auditing over incomplete logs: theory, implementation and applications
We present the design, implementation and evaluation of an algorithm that checks audit logs for compliance with privacy and security policies. The algorithm, which we name reduce,...
Deepak Garg, Limin Jia, Anupam Datta
SIGECOM
2006
ACM
143views ECommerce» more  SIGECOM 2006»
15 years 3 months ago
The computational complexity of nash equilibria in concisely represented games
Games may be represented in many different ways, and different representations of games affect the complexity of problems associated with games, such as finding a Nash equilib...
Grant Schoenebeck, Salil P. Vadhan
PODS
2004
ACM
130views Database» more  PODS 2004»
15 years 9 months ago
Computational Complexity of Itemset Frequency Satisfiability
Computing frequent itemsets is one of the most prominent problems in data mining. We introduce a new, related problem, called FREQSAT: given some itemset-interval pairs, does ther...
Toon Calders
FUIN
2006
128views more  FUIN 2006»
14 years 9 months ago
A Rewriting Framework for Rule-Based Programming Dynamic Applications
In recent years light-weighted formal methods are of growing interest in construction and analysis of complex concurrent software system. A new rule-action based term rewriting fr...
Anatoly E. Doroshenko, Ruslan Shevchenko