Sciweavers

344 search results - page 47 / 69
» On the Discrete Symmetric Localization Problem
Sort
View
111
Voted
CDC
2009
IEEE
243views Control Systems» more  CDC 2009»
15 years 2 months ago
A distributed newton method for network optimization
— Most existing work uses dual decomposition and subgradient methods to solve network optimization problems in a distributed manner, which suffer from slow convergence rate prope...
Ali Jadbabaie, Asuman E. Ozdaglar, Michael Zargham
GECCO
2006
Springer
157views Optimization» more  GECCO 2006»
15 years 1 months ago
How randomized search heuristics find maximum cliques in planar graphs
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
Tobias Storch
CSCW
2000
ACM
15 years 2 months ago
Consistency in replicated continuous interactive media
In this paper we investigate how consistency can be ensured for replicated continuous interactive media, i.e., replicated media which change their state in reaction to user initia...
Martin Mauve
SIGGRAPH
2010
ACM
14 years 10 months ago
Motion regularization for matting motion blurred objects
Abstract-- This paper addresses the problem of matting motion blurred objects from a single image. Existing single-image matting methods are designed to extract static objects that...
Hai Ting Lin, Yu-Wing Tai, Michael S. Brown
74
Voted
CORR
2007
Springer
104views Education» more  CORR 2007»
14 years 10 months ago
Observable Graphs
An edge-colored directed graph is observable if an agent that moves along its edges is able to determine his position in the graph after a sufficiently long observation of the edge...
Raphael M. Jungers, Vincent D. Blondel