1717 search results - page 68 / 344 » A Computable Spectral Theorem |
220
click to vote
POPL
2008
ACM
16 years 4 months ago
2008
ACM
The proofs of major results of Computability Theory like Rice, Rice-Shapiro or Kleene's fixed point theorem hide more information of what is usually expressed in their respec...
150
click to vote
FOCS
2006
IEEE
15 years 10 months ago
2006
IEEE
We prove an upper bound, tight up to a factor of 2, for the number of vertices of level at most in an arrangement of n halfspaces in Rd , for arbitrary n and d (in particular, the...
121
click to vote
ACCV
2006
Springer
15 years 10 months ago
2006
Springer
An occluding contour of a sphere is projected to a conic in the perspective image, and such a conic is called a sphere image. Recently, it has been discovered that each sphere imag...
141
click to vote
RANDOM
1997
Springer
15 years 8 months ago
1997
Springer
The current proof of the PCP Theorem (i.e., NP = PCP(log, O(1))) is very complicated. One source of difficulty is the technically involved analysis of low-degree tests. Here, we r...
140
click to vote
BIRTHDAY
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. The Operational Transformation (OT) approach is a technique for supporting optimistic replication in collaborative and mobile systems. It allows the users to concurrently...