Sciweavers

3328 search results - page 189 / 666
» On Plateaued Functions and Their Constructions
Sort
View
TCC
2007
Springer
92views Cryptology» more  TCC 2007»
16 years 20 days ago
One-Way Permutations, Interactive Hashing and Statistically Hiding Commitments
We present a lower bound on the round complexity of a natural class of black-box constructions of statistically hiding commitments from one-way permutations. This implies a Ω( n ...
Hoeteck Wee
COCO
2005
Springer
124views Algorithms» more  COCO 2005»
16 years 3 days ago
Tolerant Versus Intolerant Testing for Boolean Properties
A property tester with high probability accepts inputs satisfying a given property and rejects inputs that are far from satisfying it. A tolerant property tester, as defined by P...
Eldar Fischer, Lance Fortnow
ICPR
2000
IEEE
15 years 11 months ago
A Graph-Based Global Registration for 2D Mosaics
We describe a graph-based global registration method for creating 2D mosaic images. When multi-frames overlap in space, global registration is necessary to minimize the accumulate...
Eun-Young Kang, Isaac Cohen, Gérard G. Medi...
AAAI
2008
15 years 9 months ago
Classification by Discriminative Regularization
Classification is one of the most fundamental problems in machine learning, which aims to separate the data from different classes as far away as possible. A common way to get a g...
Bin Zhang, Fei Wang, Ta-Hsin Li, Wen Jun Yin, Jin ...
ICML
2010
IEEE
15 years 7 months ago
An Analysis of the Convergence of Graph Laplacians
Existing approaches to analyzing the asymptotics of graph Laplacians typically assume a well-behaved kernel function with smoothness assumptions. We remove the smoothness assumpti...
Daniel Ting, Ling Huang, Michael I. Jordan