Sciweavers

451 search results - page 26 / 91
» Some Lower Bounds on Geometric Separability Problems
Sort
View
COLT
2008
Springer
14 years 11 months ago
Almost Tight Upper Bound for Finding Fourier Coefficients of Bounded Pseudo- Boolean Functions
A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...
Sung-Soon Choi, Kyomin Jung, Jeong Han Kim
ISAAC
2009
Springer
140views Algorithms» more  ISAAC 2009»
15 years 4 months ago
Shifting Strategy for Geometric Graphs without Geometry
We give a simple framework which is an alternative to the celebrated and widely used shifting strategy of Hochbaum and Maass [J. ACM, 1985] which has yielded efficient algorithms ...
Imran A. Pirwani
ICCV
2011
IEEE
13 years 9 months ago
Multiplexed Illumination for Scene Recovery in the Presence of Global Illumination
Global illumination effects such as inter-reflections and subsurface scattering result in systematic, and often significant errors in scene recovery using active illumination. R...
Jinwei Gu, Toshihiro Kabayashi, Mohit Gupta, Shree...
PODS
2008
ACM
128views Database» more  PODS 2008»
15 years 9 months ago
Shape sensitive geometric monitoring
A fundamental problem in distributed computation is the distributed evaluation of functions. The goal is to determine the value of a function over a set of distributed inputs, in ...
Izchak Sharfman, Assaf Schuster, Daniel Keren
WCC
2005
Springer
117views Cryptology» more  WCC 2005»
15 years 3 months ago
Interpolation of Functions Related to the Integer Factoring Problem
The security of the RSA public key cryptosystem depends on the intractability of the integer factoring problem. This paper shall give some theoretical support to the assumption of ...
Clemens Adelmann, Arne Winterhof