Sciweavers

1172 search results - page 10 / 235
» Constructions of generalized Sidon sets
Sort
View
ICML
2003
IEEE
14 years 11 months ago
Online Convex Programming and Generalized Infinitesimal Gradient Ascent
Convex programming involves a convex set F Rn and a convex cost function c : F R. The goal of convex programming is to find a point in F which minimizes c. In online convex prog...
Martin Zinkevich
ICDE
2007
IEEE
129views Database» more  ICDE 2007»
14 years 5 months ago
Ontology-driven Rule Generalization and Categorization for Market Data
—Radio Frequency Identification (RFID) is an emerging technique that can significantly enhance supply chain processes and deliver customer service improvements. RFID provides use...
Dongwoo Won, Dennis McLeod
ICDE
2007
IEEE
228views Database» more  ICDE 2007»
14 years 5 months ago
A General Cost Model for Dimensionality Reduction in High Dimensional Spaces
Similarity search usually encounters a serious problem in the high dimensional space, known as the “curse of dimensionality”. In order to speed up the retrieval efficiency, p...
Xiang Lian, Lei Chen 0002
STOC
2009
ACM
168views Algorithms» more  STOC 2009»
14 years 11 months ago
Fault-tolerant spanners for general graphs
The paper concerns graph spanners that are resistant to vertex or edge failures. Given a weighted undirected n-vertex graph G = (V, E) and an integer k 1, the subgraph H = (V, E ...
Shiri Chechik, Michael Langberg, David Peleg, Liam...
STOC
2004
ACM
157views Algorithms» more  STOC 2004»
14 years 11 months ago
Derandomizing homomorphism testing in general groups
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
Amir Shpilka, Avi Wigderson