414 search results - page 59 / 83 » On discrete norms of polynomials |
162
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
This paper presents a new method for the reconstruction of a surface from its ? and ? gradient field, measured, for example, via Photometric Stereo. The new algorithm produces the...
145
click to vote
COCOA
2009
Springer
16 years 20 days ago
2009
Springer
Abstract. We study Facility Location games played by n agents situated on the nodes of a graph. Each agent orders installation of a facility at a node of the graph and pays connect...
149
Voted
COMPGEOM
2009
ACM
16 years 18 days ago
2009
ACM
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
165
click to vote
COMPGEOM
1993
ACM
15 years 10 months ago
1993
ACM
We give a practical and provably good Monte Carlo algorithm for approximating center points. Let P be a set of n points in IRd . A point c ∈ IRd is a β-center point of P if eve...
161
click to vote
ACMICEC
2007
ACM
15 years 10 months ago
2007
ACM
Bids during an online auction arrive at unequally-spaced discrete time points. Our goal is to capture the entire continuous price-evolution function by representing it as a functi...