112 search results - page 18 / 23 » Approximate methods for convex minimization problems with se... |
ICCV
2009
IEEE
16 years 4 months ago
2009
IEEE
The concept of graph cuts is by now a standard method
for all sorts of low level vision problems. Its popularity is
largely due to the fact that globally or near globally optimal...
EDBT
2006
ACM
15 years 11 months ago
2006
ACM
Recent years have seen growing interest in effective algorithms for summarizing and querying massive, high-speed data streams. Randomized sketch synopses provide accurate approxima...
MP
2008
14 years 11 months ago
2008
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...
CDC
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract— In this paper we consider several problems involving control with limited actuation and sampling rates. Event-based control has emerged as an attractive approach for ad...
109
click to vote
CVPR
2004
IEEE
16 years 1 months ago
2004
IEEE
In this paper a method for fitting open surfaces to an unorganized set of data points is presented using a level set representation of the surface. This is done by tracking a curv...