74 search results - page 6 / 15 » Every Computably Enumerable Random Real Is Provably Computab... |
108
click to vote
PVLDB
2010
14 years 10 months ago
2010
With the emergence of new applications, e.g., computational biology, new software engineering techniques, social networks, etc., more data is in the form of graphs. Locating occur...
CSL
2003
Springer
15 years 4 months ago
2003
Springer
Constructive dimension and constructive strong dimension are effectivizations of the Hausdorff and packing dimensions, respectively. Each infinite binary sequence A is assigned...
81
Voted
CSFW
2010
IEEE
15 years 3 months ago
2010
IEEE
—Quantitative information-flow analysis (QIF) is an emerging technique for establishing information-theoretic confidentiality properties. Automation of QIF is an important step...
98
Voted
STACS
2012
Springer
13 years 7 months ago
2012
Springer
The Denjoy-Young-Saks Theorem from classical analysis states that for an arbitrary function f : R → R, the Denjoy alternative holds outside a null set, i.e., for almost every re...
96
Voted
RECOMB
2004
Springer
15 years 12 months ago
2004
Springer
In nature, one finds large collections of different protein sequences exhibiting roughly the same three-dimensional structure, and this observation underpins the study of structur...