Sciweavers

2219 search results - page 43 / 444
» Dynamic Programming and Graph Algorithms in Computer Vision
Sort
View
VISSYM
2007
13 years 11 months ago
Online Dynamic Graph Drawing
This paper presents an algorithm for drawing a sequence of graphs online. The algorithm strives to maintain the global structure of the graph and thus the user's mental map, ...
Yaniv Frishman, Ayellet Tal
ICALP
2010
Springer
14 years 20 days ago
Testing 2-Vertex Connectivity and Computing Pairs of Vertex-Disjoint s-t Paths in Digraphs
We present an O(m + n)-time algorithm that tests if a given directed graph is 2-vertex connected, where m is the number of arcs and n is the number of vertices. Based on this resul...
Loukas Georgiadis
LISP
2008
96views more  LISP 2008»
13 years 9 months ago
Dynamic slicing of lazy functional programs based on redex trails
Abstract. Tracing computations is a widely used methodology for program debugging. Lazy languages, however, pose new demands on tracing techniques because following the actual trac...
Claudio Ochoa, Josep Silva, Germán Vidal
STOC
2010
ACM
193views Algorithms» more  STOC 2010»
14 years 1 months ago
Maintaining a large matching and a small vertex cover
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
Krzysztof Onak, Ronitt Rubinfeld
SIGGRAPH
1998
ACM
14 years 1 months ago
A Multiscale Model of Adaptation and Spatial Vision for Realistic Image Display
In this paper we develop a computational model of adaptation and spatial vision for realistic tone reproduction. The model is based on a multiscale representation of pattern, lumi...
Sumanta N. Pattanaik, James A. Ferwerda, Mark D. F...