Sciweavers

346 search results - page 45 / 70
» A New Approximate Maximal Margin Classification Algorithm
Sort
View
SODA
2008
ACM
77views Algorithms» more  SODA 2008»
13 years 9 months ago
Online make-to-order joint replenishment model: primal dual competitive algorithms
In this paper, we study an online make-to-order variant of the classical joint replenishment problem (JRP) that has been studied extensively over the years and plays a fundamental...
Niv Buchbinder, Tracy Kimbrel, Retsef Levi, Konsta...
SIGECOM
2008
ACM
152views ECommerce» more  SIGECOM 2008»
13 years 7 months ago
On characterizations of truthful mechanisms for combinatorial auctions and scheduling
We characterize truthful mechanisms in two multi-parameter domains. The first characterization shows that every mechanism for combinatorial auctions with two subadditive bidders t...
Shahar Dobzinski, Mukund Sundararajan
COMPLIFE
2006
Springer
13 years 11 months ago
A Point-Matching Based Algorithm for 3D Surface Alignment of Drug-Sized Molecules
Abstract. Molecular shapes play an important role in molecular interactions, e.g., between a protein and a ligand. The `outer' shape of a molecule can be approximated by its s...
Daniel Baum, Hans-Christian Hege
PAMI
2008
135views more  PAMI 2008»
13 years 7 months ago
MultiK-MHKS: A Novel Multiple Kernel Learning Algorithm
In this paper, we develop a new effective multiple kernel learning algorithm. First, we map the input data into m different feature spaces by m empirical kernels, where each genera...
Zhe Wang, Songcan Chen, Tingkai Sun
ICML
2006
IEEE
14 years 8 months ago
Generalized spectral bounds for sparse LDA
We present a discrete spectral framework for the sparse or cardinality-constrained solution of a generalized Rayleigh quotient. This NPhard combinatorial optimization problem is c...
Baback Moghaddam, Yair Weiss, Shai Avidan