Sciweavers

1819 search results - page 2 / 364
» Computability and Representations of the Zero Set
Sort
View
SCALESPACE
2005
Springer
13 years 10 months ago
Sparse Finite Element Level-Sets for Anisotropic Boundary Detection in 3D Images
Level-Set methods have been successfully applied to 2D and 3D boundary detection problems. The geodesic active contour model has been particularly successful. Several algorithms fo...
Martin Weber, Andrew Blake, Roberto Cipolla
FOCS
2003
IEEE
13 years 10 months ago
Zero-Knowledge Sets
We show how a polynomial-time prover can commit to an arbitrary finite set Ë of strings so that, later on, he can, for any string Ü, reveal with a proof whether Ü ¾ Ë or Ü ...
Silvio Micali, Michael O. Rabin, Joe Kilian
DIS
2006
Springer
13 years 9 months ago
Symmetric Item Set Mining Based on Zero-Suppressed BDDs
In this paper, we propose a method for discovering hidden information from large-scale item set data based on the symmetry of items. Symmetry is a fundamental concept in the theory...
Shin-ichi Minato
IACR
2011
152views more  IACR 2011»
12 years 5 months ago
Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
Abstract. In Asiacrypt 2010, Groth constructed the only previously known sublinearcommunication NIZK argument for circuit satisfiability in the common reference string model. We p...
Helger Lipmaa