Sciweavers

790 search results - page 74 / 158
» Subexponential Parameterized Algorithms
Sort
View
ICML
2004
IEEE
16 years 4 months ago
Online and batch learning of pseudo-metrics
We describe and analyze an online algorithm for supervised learning of pseudo-metrics. The algorithm receives pairs of instances and predicts their similarity according to a pseud...
Shai Shalev-Shwartz, Yoram Singer, Andrew Y. Ng
PKC
2005
Springer
167views Cryptology» more  PKC 2005»
15 years 8 months ago
Converse Results to the Wiener Attack on RSA
A well-known attack on RSA with low secret-exponent d was given by Wiener about 15 years ago. Wiener showed that using continued fractions, one can efficiently recover the secret-...
Ron Steinfeld, Scott Contini, Huaxiong Wang, Josef...
CORR
2010
Springer
164views Education» more  CORR 2010»
15 years 1 months ago
Is submodularity testable?
: We initiate the study of property testing of submodularity on the boolean hypercube. Submodular functions come up in a variety of applications in combinatorial optimization. For ...
C. Seshadhri, Jan Vondrák
WWW
2008
ACM
16 years 3 months ago
Composing and optimizing data providing web services
In this paper, we propose a new approach to automatically compose data providing Web services. Our approach exploits existing mature works done in data integration systems. Specif...
Mahmoud Barhamgi, Djamal Benslimane, Aris M. Oukse...
SDM
2007
SIAM
182views Data Mining» more  SDM 2007»
15 years 4 months ago
Distance Preserving Dimension Reduction for Manifold Learning
Manifold learning is an effective methodology for extracting nonlinear structures from high-dimensional data with many applications in image analysis, computer vision, text data a...
Hyunsoo Kim, Haesun Park, Hongyuan Zha