Sciweavers

505 search results - page 14 / 101
» Optimal Error Correction for Computationally Bounded Noise
Sort
View
CGF
2007
135views more  CGF 2007»
13 years 9 months ago
Variational 3D Shape Segmentation for Bounding Volume Computation
We propose a variational approach to computing an optimal segmentation of a 3D shape for computing a union of tight bounding volumes. Based on an affine invariant measure of e-ti...
Lin Lu, Yi-King Choi, Wenping Wang, Myung-Soo Kim
ICCV
2007
IEEE
14 years 11 months ago
pLSA for Sparse Arrays With Tsallis Pseudo-Additive Divergence: Noise Robustness and Algorithm
We introduce the Tsallis divergence error measure in the context of pLSA matrix and tensor decompositions showing much improved performance in the presence of noise. The focus of ...
Tamir Hazan, Roee Hardoon, Amnon Shashua
CRYPTO
2001
Springer
111views Cryptology» more  CRYPTO 2001»
14 years 1 months ago
On the Cost of Reconstructing a Secret, or VSS with Optimal Reconstruction Phase
Consider a scenario where an l-bit secret has been distributed among n players by an honest dealer using some secret sharing scheme. Then, if all players behave honestly, the secre...
Ronald Cramer, Ivan Damgård, Serge Fehr
BIOINFORMATICS
2002
100views more  BIOINFORMATICS 2002»
13 years 8 months ago
Optimal algorithms for local vertex quartet cleaning
Reconstructing evolutionary trees is an important problem in biology. A response to the computational intractability of most of the traditional criteria for inferring evolutionary...
Gianluca Della Vedova, Todd Wareham
GLOBECOM
2006
IEEE
14 years 3 months ago
Optimal Routing in the Worst-Case-Error Metric
— This paper considers the problem of finding the path with minimum (zero) worst possible number of errors in a network with V nodes where (1) some nodes are capable of correcti...
Edwin Soedarmadji