Sciweavers

2446 search results - page 489 / 490
» Choiceless Polynomial Time
Sort
View
IOR
2011
96views more  IOR 2011»
12 years 11 months ago
An Ascending Vickrey Auction for Selling Bases of a Matroid
Consider selling bundles of indivisible goods to buyers with concave utilities that are additively separable in money and goods. We propose an ascending auction for the case when ...
Sushil Bikhchandani, Sven de Vries, James Schummer...
SDM
2011
SIAM
218views Data Mining» more  SDM 2011»
12 years 10 months ago
Segmented nestedness in binary data
A binary matrix is fully nested if its columns form a chain of subsets; that is, any two columns are ordered by the subset relation, where we view each column as a subset of the r...
Esa Junttila, Petteri Kaski
SIGECOM
2011
ACM
203views ECommerce» more  SIGECOM 2011»
12 years 10 months ago
Polynomial-time computation of exact correlated equilibrium in compact games
In a landmark paper, Papadimitriou and Roughgarden [2008] described a polynomial-time algorithm (“Ellipsoid Against Hope”) for computing sample correlated equilibria of concis...
Albert Xin Jiang, Kevin Leyton-Brown
SIGIR
2011
ACM
12 years 10 months ago
Fast context-aware recommendations with factorization machines
The situation in which a choice is made is an important information for recommender systems. Context-aware recommenders take this information into account to make predictions. So ...
Steffen Rendle, Zeno Gantner, Christoph Freudentha...
COCOA
2011
Springer
12 years 7 months ago
Algorithmic Aspects of Heterogeneous Biological Networks Comparison
Biological networks are commonly used to model molecular activity within the cell. Recent experimental studies have shown that the detection of conserved subnetworks across several...
Guillaume Blin, Guillaume Fertin, Hafedh Mohamed-B...