Sciweavers

526 search results - page 41 / 106
» On circularly symmetric functions
Sort
View
CORR
2010
Springer
84views Education» more  CORR 2010»
13 years 9 months ago
Improved Inapproximability For Submodular Maximization
We show that it is Unique Games-hard to approximate the maximum of a submodular function to within a factor 0.695, and that it is Unique Games-hard to approximate the maximum of a ...
Per Austrin
ECCV
2004
Springer
14 years 1 months ago
Coaxial Omnidirectional Stereopsis
Catadioptric omnidirectional sensors (catadioptric cameras) capture instantaneous images with panoramic 360 field of view. Entire surroundings are projected via a circularly symme...
Libor Spacek
IVS
2006
240views more  IVS 2006»
13 years 10 months ago
Business process impact visualization and anomaly detection
Business operations involve many factors and relationships and are modeled as complex business process workflows. The execution of these business processes generates vast volumes ...
Ming C. Hao, Daniel A. Keim, Umeshwar Dayal, J&oum...
INDOCRYPT
2005
Springer
14 years 3 months ago
A Universally Composable Scheme for Electronic Cash
We propose a scheme for electronic cash based on symmetric primitives. The scheme is secure in the framework for universal composability assuming the existence of a symmetric CCA2-...
Mårten Trolin
JC
2008
68views more  JC 2008»
13 years 10 months ago
On the number of minima of a random polynomial
We give an upper bound in O(d(n+1)/2 ) for the number of critical points of a normal random polynomial. The number of minima (resp. maxima) is in O(d(n+1)/2 )Pn, where Pn is the (...
Jean-Pierre Dedieu, Gregorio Malajovich