2738 search results - page 179 / 548 » The Frobenius Problem and Its Generalizations |
128
click to vote
ESA
2007
Springer
15 years 10 months ago
2007
Springer
We study the online ad-auctions problem introduced by Mehta et. al. [15]. We design a (1 − 1/e)competitive (optimal) algorithm for the problem, which is based on a clean primal-...
143
click to vote
COMPGEOM
2006
ACM
15 years 10 months ago
2006
ACM
Persistent homology is the mathematical core of recent work on shape, including reconstruction, recognition, and matching. Its pertinent information is encapsulated by a pairing o...
136
click to vote
ESA
2005
Springer
15 years 10 months ago
2005
Springer
We introduce the Minimum-size bounded-capacity cut (MinSBCC) problem, in which we are given a graph with an identified source and seek to find a cut minimizing the number of node...
123
click to vote
CPAIOR
2004
Springer
15 years 10 months ago
2004
Springer
To improve solution robustness, we introduce the concept of super solutions to constraint programming. An (a, b)-super solution is one in which if a variables lose their values, th...
163
click to vote
CDC
2009
IEEE
15 years 9 months ago
2009
IEEE
Abstract— We study the problem of maximizing the aggregated revenue in sensor networks with deadline constraints. Our model is that of a sensor network that is arranged in the fo...