Sciweavers

281 search results - page 43 / 57
» The Proof Complexity of Linear Algebra
Sort
View
SPAA
2004
ACM
14 years 1 months ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter
COMPGEOM
2009
ACM
14 years 2 months ago
Proximity of persistence modules and their diagrams
Topological persistence has proven to be a key concept for the study of real-valued functions defined over topological spaces. Its validity relies on the fundamental property tha...
Frédéric Chazal, David Cohen-Steiner...
FCCM
2006
IEEE
195views VLSI» more  FCCM 2006»
14 years 2 months ago
A Parallel Hardware Architecture for fast Gaussian Elimination over GF(2)
This paper presents a hardware-optimized variant of the well-known Gaussian elimination over GF(2) and its highly efficient implementation. The proposed hardware architecture, we...
Andrey Bogdanov, M. C. Mertens
EUROCRYPT
1997
Springer
13 years 11 months ago
A Secure and Optimally Efficient Multi-Authority Election Scheme
In this paper we present a new multi-authority secret-ballot election scheme that guarantees privacy, universal verifiability, and robustness. It is the first scheme for which the ...
Ronald Cramer, Rosario Gennaro, Berry Schoenmakers
ICCV
1999
IEEE
14 years 9 months ago
Euclidean Reconstruction and Reprojection up to Subgroups
The necessary and sufficient conditions for being able to estimate scene structure, motion and camera calibration from a sequence of images are very rarely satisfied in practice. ...
Yi Ma, Stefano Soatto, Jana Kosecka, Shankar Sastr...