519 search results - page 18 / 104 » A New Approach to Strongly Polynomial Linear Programming |
108
click to vote
ICPR
2000
IEEE
16 years 2 months ago
2000
IEEE
This work presents a new approach to contour representation and coding. It consists of an improved fitting of high-degree (4th to 18th ) implicit polynomials (IPs) to the contour,...
101
click to vote
VISUALIZATION
2000
IEEE
15 years 5 months ago
2000
IEEE
We present a new approach to surface reconstruction based on the Delaunay complex. First we give a simple and fast algorithm that picks locally a surface at each vertex. For that,...
129
click to vote
WINE
2010
Springer
14 years 11 months ago
2010
Springer
Online auctions in which items are sold in an online fashion with little knowledge about future bids are common in the internet environment. We study here a problem in which an auc...
103
click to vote
ICALP
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. Given a family of subsets of an n-element universe, the kcover problem asks whether there are k sets in the family whose union contains the universe; in the k-packing pro...
134
click to vote
ICALP
2009
Springer
16 years 1 months ago
2009
Springer
We consider graphical games in which edges are zero-sum games between the endpoints/players; the payoff of a player is the sum of the payoffs from each incident edge. We give a si...