Sciweavers

1819 search results - page 8 / 364
» Computability and Representations of the Zero Set
Sort
View
CVPR
2005
IEEE
14 years 9 months ago
Particle Filtering for Geometric Active Contours with Application to Tracking Moving and Deforming Objects
Geometric active contours are formulated in a manner which is parametrization independent. As such, they are amenable to representation as the zero level set of the graph of a hig...
Yogesh Rathi, Namrata Vaswani, Allen Tannenbaum, A...
DM
1998
54views more  DM 1998»
13 years 7 months ago
On the structure of a random sum-free set of positive integers
Cameron introduced a natural probability measure on the set S of sum-free sets, and asked which sets of sum-free sets have a positive probability of occurring in this probability m...
Neil J. Calkin
IACR
2011
147views more  IACR 2011»
12 years 7 months ago
Adaptive Security of Concurrent Non-Malleable Zero-Knowledge
A zero-knowledge protocol allows a prover to convince a verifier of the correctness of a statement without disclosing any other information to the verifier. It is a basic tool a...
Zhenfu Cao, Zongyang Zhang, Yunlei Zhao
TCC
2009
Springer
130views Cryptology» more  TCC 2009»
14 years 8 months ago
Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer
In the setting of secure computation, a set of parties wish to securely compute some function of their inputs, in the presence of an adversary. The adversary in question may be st...
Yehuda Lindell, Hila Zarosim
COMGEO
2002
ACM
13 years 7 months ago
Beta-skeletons have unbounded dilation
A fractal construction shows that, for any > 0, the -skeleton of a point set can have arbitrarily large dilation: (nc ), where c is a constant depending on and going to zero ...
David Eppstein