Sciweavers

1888 search results - page 185 / 378
» Proof theory and computational analysis
Sort
View
119
Voted
SAC
2010
ACM
15 years 7 months ago
Background knowledge in formal concept analysis: constraints via closure operators
The aim of this short paper is to present a general method of using background knowledge to impose constraints in conceptual clustering of object-attribute relational data. The pr...
Radim Belohlávek, Vilém Vychodil
95
Voted
WWW
2008
ACM
16 years 1 months ago
Secure or insure?: a game-theoretic analysis of information security games
Despite general awareness of the importance of keeping one's system secure, and widespread availability of consumer security technologies, actual investment in security remai...
Jens Grossklags, Nicolas Christin, John Chuang
COMPUTING
2007
127views more  COMPUTING 2007»
15 years 23 days ago
Analyzing a generalized Loop subdivision scheme
In this paper a class of subdivision schemes generalizing the algorithm of Loop is presented. The stencils have the same support as those from the algorithm of Loop, but allow a v...
Ingo Ginkel, Georg Umlauf
TCS
2002
15 years 12 days ago
Binary (generalized) Post Correspondence Problem
An instance of the (Generalized) Post Correspondence Problem is during the decision process typically reduced to one or more other instances, called its successors. In this paper ...
Vesa Halava, Tero Harju, Mika Hirvensalo
85
Voted
FOSSACS
2009
Springer
15 years 7 months ago
On the Foundations of Quantitative Information Flow
There is growing interest in quantitative theories of information flow in a variety of contexts, such as secure information flow, anonymity protocols, and side-channel analysis. ...
Geoffrey Smith