1717 search results - page 267 / 344 » A Computable Spectral Theorem |
118
Voted
LICS
2007
IEEE
15 years 6 months ago
2007
IEEE
In predicate logic, the proof that a theorem P holds in a theory Th is typically conducted in natural deduction or in the sequent calculus using all the information contained in t...
108
Voted
ICALP
2007
Springer
15 years 6 months ago
2007
Springer
While data compression and Kolmogorov complexity are both about effective coding of words, the two settings differ in the following respect. A compression algorithm or compressor...
107
click to vote
CSFW
2006
IEEE
15 years 6 months ago
2006
IEEE
Recently, there has been much interest in extending models for simulation-based security in such a way that the runtime of protocols may depend on the length of their input. Findi...
95
Voted
ICDM
2006
IEEE
15 years 6 months ago
2006
IEEE
Free tree, as a special graph which is connected, undirected and acyclic, is extensively used in domains such as computational biology, pattern recognition, computer networks, XML...
117
Voted
ACL2
2006
ACM
15 years 6 months ago
2006
ACM
Biologists studying the evolutionary relationships between organisms use software packages to solve the computational problems they encounter. Several of these problems involve th...