1717 search results - page 234 / 344 » A Computable Spectral Theorem |
136
click to vote
DAC
2001
ACM
16 years 6 months ago
2001
ACM
Watermarking of hardware and software designs is an effective mechanism for intellectual property protection (IPP). Two important criteria for watermarking schemes are credibility...
163
click to vote
ICML
2005
IEEE
16 years 6 months ago
2005
IEEE
Mappings to structured output spaces (strings, trees, partitions, etc.) are typically learned using extensions of classification algorithms to simple graphical structures (eg., li...
183
click to vote
CADE
2005
Springer
16 years 5 months ago
2005
Springer
We describe the design and implementation of a higher-order tabled logic programming interpreter where some redundant and infinite computation is eliminated by memoizing sub-comput...
152
click to vote
STOC
2007
ACM
16 years 5 months ago
2007
ACM
In this paper we prove tight bounds on the combinatorial and topological complexity of sets defined in terms of n definable sets belonging to some fixed definable family of sets i...
142
click to vote
FOSSACS
2010
Springer
16 years 8 days ago
2010
Springer
Λµ-calculus was introduced as a Böhm-complete extension of Parigot's λµ-calculus. Λµ-calculus, contrarily to Parigot's calculus, is a calculus of CBN delimited con...