Sciweavers

180 search results - page 1 / 36
» Measure on P: Robustness of the Notion
Sort
View
MFCS
1995
Springer
13 years 8 months ago
Measure on P: Robustness of the Notion
In AS , we de ned a notion of measure on the complexity class P in the spirit of the work of Lutz L92 that provides a notion of measure on complexity classes at least as large as...
Eric Allender, Martin Strauss
P2P
2009
IEEE
126views Communications» more  P2P 2009»
13 years 11 months ago
Robust Lifetime Measurement in Large-Scale P2P Systems with Non-Stationary Arrivals
—Characterizing user churn has become an important topic in studying P2P networks, both in theoretical analysis and system design. Recent work [26] has shown that direct sampling...
Xiaoming Wang, Zhongmei Yao, Yueping Zhang, Dmitri...
ICCV
2007
IEEE
14 years 6 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
FOCM
2011
107views more  FOCM 2011»
12 years 8 months ago
Quantifying Transversality by Measuring the Robustness of Intersections
By definition, transverse intersections are stable under infinitesimal perturbations. Using persistent homology, we extend this notion to a measure. Given a space of perturbatio...
Herbert Edelsbrunner, Dmitriy Morozov, Amit K. Pat...
COMPGEOM
1997
ACM
13 years 9 months ago
Robust Proximity Queries: An Illustration of Degree-Driven Algorithm Design
Abstract. In the context of methodologies intended to confer robustness to geometric algorithms, we elaborate on the exact-computation paradigm and formalize the notion of degree o...
Giuseppe Liotta, Franco P. Preparata, Roberto Tama...