Sciweavers

6315 search results - page 389 / 1263
» Approximating Solution Structure
Sort
View
FOCS
2010
IEEE
15 years 4 months ago
Replacement Paths via Fast Matrix Multiplication
Let G be a directed edge-weighted graph and let P be a shortest path from s to t in G. The replacement paths problem asks to compute, for every edge e on P, the shortest s-to-t pat...
Oren Weimann, Raphael Yuster
CORR
2010
Springer
127views Education» more  CORR 2010»
15 years 4 months ago
On Turing machines, dynamical systems and the Atiyah problem
: We consider mixed Dirichlet-Robin problems on scale irregular domains. In particular, we study the asymptotic convergence of the solutions of elliptic problems with Robin boundar...
Lukasz Grabowski
181
Voted
ESA
2005
Springer
114views Algorithms» more  ESA 2005»
16 years 11 days ago
Unbalanced Graph Cuts
We introduce the Minimum-size bounded-capacity cut (MinSBCC) problem, in which we are given a graph with an identified source and seek to find a cut minimizing the number of node...
Ara Hayrapetyan, David Kempe, Martin Pál, Z...
WEA
2005
Springer
97views Algorithms» more  WEA 2005»
16 years 10 days ago
Multiple-Winners Randomized Tournaments with Consensus for Optimization Problems in Generic Metric Spaces
Abstract. Extensions of the randomized tournaments techniques introduced in [6, 7] to approximate solutions of 1-median and diameter computation of finite subsets of general metri...
Domenico Cantone, Alfredo Ferro, Rosalba Giugno, G...
CDC
2009
IEEE
128views Control Systems» more  CDC 2009»
15 years 11 months ago
The entropy penalized minimum energy estimator
This paper addresses the state estimation problem of nonlinear systems. We formulate the problem using a minimum energy estimator (MEE) approach and propose an entropy penalized sc...
Sergio Daniel Pequito, A. Pedro Aguiar, Diogo A. G...