Sciweavers

895 search results - page 87 / 179
» Approximate convex decomposition
Sort
View
AUTOMATICA
2008
127views more  AUTOMATICA 2008»
14 years 10 months ago
On decentralized negotiation of optimal consensus
A consensus problem consists of finding a distributed control strategy that brings the state or output of a group of agents to a common value, a consensus point. In this paper, we...
Björn Johansson, Alberto Speranzon, Mikael Jo...
JMIV
2006
161views more  JMIV 2006»
14 years 9 months ago
Image Restoration with Discrete Constrained Total Variation Part I: Fast and Exact Optimization
This paper deals with the total variation minimization problem in image restoration for convex data fidelityfunctionals.Weproposeanewandfastalgorithmwhichcomputesanexactsolutionint...
Jérôme Darbon, Marc Sigelle
CORR
2010
Springer
159views Education» more  CORR 2010»
14 years 7 months ago
Counting Plane Graphs: Flippability and its Applications
We generalize the notions of flippable and simultaneously-flippable edges in a triangulation of a set S of points in the plane, into so called pseudo simultaneously-flippable edge...
Michael Hoffmann, Micha Sharir, Adam Sheffer, Csab...
ECCV
1996
Springer
15 years 11 months ago
Image Recognition with Occlusions
We study the problem of how to detect \interesting objects" appeared in a given image, I. Our approach is to treat it as a function approximation problem based on an over-redu...
Tyng-Luh Liu, Michael J. Donahue, Davi Geiger, Rob...
COMPGEOM
2005
ACM
14 years 11 months ago
Fast construction of nets in low dimensional metrics, and their applications
We present a near linear time algorithm for constructing hierarchical nets in finite metric spaces with constant doubling dimension. This data-structure is then applied to obtain...
Sariel Har-Peled, Manor Mendel