Sciweavers

719 search results - page 142 / 144
» Solving Sparse Linear Constraints
Sort
View
MP
2002
143views more  MP 2002»
13 years 9 months ago
Extending Dantzig's bound to the bounded multiple-class binary Knapsack problem
The bounded multiple-class binary knapsack problem is a variant of the knapsack problem where the items are partitioned into classes and the item weights in each class are a multip...
François Vanderbeck
SIAMAM
2011
13 years 4 months ago
Modeling and Design Optimization of a Resonant Optothermoacoustic Trace Gas Sensor
Trace gas sensors that are compact and portable are being deployed for use in a variety of applications including disease diagnosis via breath analysis, monitoring of atmospheric p...
Noemi Petra, John Zweck, Susan E. Minkoff, Anatoli...
WWW
2003
ACM
14 years 10 months ago
Adaptive ranking of web pages
In this paper, we consider the possibility of altering the PageRank of web pages, from an administrator's point of view, through the modification of the PageRank equation. It...
Ah Chung Tsoi, Gianni Morini, Franco Scarselli, Ma...
NIPS
2007
13 years 11 months ago
Fixing Max-Product: Convergent Message Passing Algorithms for MAP LP-Relaxations
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
Amir Globerson, Tommi Jaakkola
ESA
2010
Springer
246views Algorithms» more  ESA 2010»
13 years 11 months ago
Estimating the Average of a Lipschitz-Continuous Function from One Sample
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
Abhimanyu Das, David Kempe