1011 search results - page 46 / 203 » The three dimensions of proofs |
165
click to vote
JSAT
2008
15 years 6 months ago
2008
In this paper, we consider the problem of classifying Hamiltonian cycles in a binary hypercube. Previous work proposed a classification of these cycles using the edge representati...
178
click to vote
FOCS
2006
IEEE
16 years 7 days 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...
137
click to vote
ICCAD
2006
IEEE
16 years 3 months ago
2006
IEEE
We present a gridless method for solving the interior problem for a set of conductors in an homogeneous dielectric, at sufficiently high frequencies, valid for conductor lengths ...
153
click to vote
ESOP
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. While a rigorous information flow analysis is a key step in obtaining meaningful end-to-end confidentiality guarantees, one must also permit possibilities for declassific...
141
click to vote
EDBT
2008
ACM
16 years 6 months ago
2008
ACM
With the explosion in the amount of semi-structured data users access and store in personal information management systems, there is a need for complex search tools to retrieve of...