Sciweavers

1142 search results - page 114 / 229
» Approximability of Clausal Constraints
Sort
View
CORR
2008
Springer
118views Education» more  CORR 2008»
15 years 6 months ago
Descent methods for Nonnegative Matrix Factorization
In this paper, we present several descent methods that can be applied to nonnegative matrix factorization and we analyze a recently developped fast block coordinate method. We als...
Ngoc-Diep Ho, Paul Van Dooren, Vincent D. Blondel
JDA
2008
101views more  JDA 2008»
15 years 6 months ago
Student-Project Allocation with preferences over Projects
We study the problem of allocating students to projects, where both students and lecturers have preferences over projects, and both projects and lecturers have capacities. In this...
David Manlove, Gregg O'Malley
MP
2008
103views more  MP 2008»
15 years 6 months ago
Aggregation and discretization in multistage stochastic programming
Multistage stochastic programs have applications in many areas and support policy makers in finding rational decisions that hedge against unforeseen negative events. In order to en...
Daniel Kuhn
SIGECOM
2008
ACM
94views ECommerce» more  SIGECOM 2008»
15 years 6 months ago
Optimizing query rewrites for keyword-based advertising
We consider the problem of query rewrites in the context of keyword advertisement. Given a three-layer graph consisting of queries, query rewrites, and the corresponding ads that ...
Azarakhsh Malekian, Chi-Chao Chang, Ravi Kumar, Gr...
JAIR
2010
130views more  JAIR 2010»
15 years 4 months ago
Join-Graph Propagation Algorithms
The paper investigates parameterized approximate message-passing schemes that are based on bounded inference and are inspired by Pearl’s belief propagation algorithm (BP). We st...
Robert Mateescu, Kalev Kask, Vibhav Gogate, Rina D...