Sciweavers

STOC
2012
ACM
209views Algorithms» more  STOC 2012»
12 years 2 months ago
Nearly optimal solutions for the chow parameters problem and low-weight approximation of halfspaces
The Chow parameters of a Boolean function f : {−1, 1}n → {−1, 1} are its n + 1 degree-0 and degree-1 Fourier coefficients. It has been known since 1961 [Cho61, Tan61] that ...
Anindya De, Ilias Diakonikolas, Vitaly Feldman, Ro...
DM
2010
140views more  DM 2010»
14 years 15 days ago
Online Ramsey games for triangles in random graphs
In the online F-avoidance edge-coloring game with r colors, a graph on n vertices is generated by at each stage randomly adding a new edge. The player must color each new edge as ...
József Balogh, Jane Butterfield
ICPR
2006
IEEE
14 years 6 months ago
Visible Edges Thresholding: a HVS based Approach
This paper presents a technique, which determines whether an edge is visible for a human eye or not. First, a threshold function is built according to the optical characteristics ...
Nicolas Hautière, Didier Aubert