Sciweavers

531 search results - page 39 / 107
» A Better Algorithm for Random k-SAT
Sort
View
KDD
2007
ACM
190views Data Mining» more  KDD 2007»
16 years 5 days ago
Model-shared subspace boosting for multi-label classification
Typical approaches to multi-label classification problem require learning an independent classifier for every label from all the examples and features. This can become a computati...
Rong Yan, Jelena Tesic, John R. Smith
87
Voted
EMO
2009
Springer
219views Optimization» more  EMO 2009»
15 years 6 months ago
An Elitist GRASP Metaheuristic for the Multi-objective Quadratic Assignment Problem
We propose an elitist Greedy Randomized Adaptive Search Procedure (GRASP) metaheuristic algorithm, called mGRASP/MH, for approximating the Pareto-optimal front in the multi-objecti...
Hui Li, Dario Landa Silva
SODA
2008
ACM
144views Algorithms» more  SODA 2008»
15 years 1 months ago
Fast dimension reduction using Rademacher series on dual BCH codes
The Fast Johnson-Lindenstrauss Transform (FJLT) was recently discovered by Ailon and Chazelle as a novel technique for performing fast dimension reduction with small distortion fr...
Nir Ailon, Edo Liberty
COMGEO
2004
ACM
14 years 11 months ago
Speeding up the incremental construction of the union of geometric objects in practice
We present a new incremental algorithm for constructing the union of n triangles in the plane. In our experiments, the new algorithm, which we call the Disjoint-Cover (DC) algorit...
Eti Ezra, Dan Halperin, Micha Sharir
SODA
2003
ACM
121views Algorithms» more  SODA 2003»
15 years 1 months ago
Competitiveness via consensus
We introduce the following consensus estimate problem. Several processors hold private and possibly different lower bounds on a value. The processors do not communicate with each ...
Andrew V. Goldberg, Jason D. Hartline