5153 search results - page 339 / 1031 » Introduction to Randomized Algorithms |
121
Voted
ALGORITHMICA
2002
15 years 4 months ago
2002
We consider the following one- and two-dimensional bucketing problems: Given a set S of n points in R1 or R2 and a positive integer b, distribute the points of S into b equal-size ...
171
click to vote
SDM
2011
SIAM
14 years 7 months ago
2011
SIAM
Sparse principal component analysis (PCA) imposes extra constraints or penalty terms to the standard PCA to achieve sparsity. In this paper, we first introduce an efficient algor...
143
click to vote
ICML
2007
IEEE
16 years 5 months ago
2007
IEEE
Inference tasks in Markov random fields (MRFs) are closely related to the constraint satisfaction problem (CSP) and its soft generalizations. In particular, MAP inference in MRF i...
246
click to vote
SIGMOD
2005
ACM
16 years 4 months ago
2005
ACM
Complex queries over high speed data streams often need to rely on approximations to keep up with their input. The research community has developed a rich literature on approximat...
107
click to vote
ICCAD
2002
IEEE
16 years 1 months ago
2002
IEEE
This paper presents an in-depth study of the theory and algorithms for the SPFD-based (Set of Pairs of Functions to be Distinguished) rewiring, and explores the flexibility in the...