Sciweavers

2294 search results - page 97 / 459
» From Path Graphs to Directed Path Graphs
Sort
View
AUTOMATICA
2007
88views more  AUTOMATICA 2007»
14 years 10 months ago
Three and higher dimensional autonomous formations: Rigidity, persistence and structural persistence
In this paper, we generalize the notion of persistence, which has been originally introduced for two-dimensional formations, to Rd for d 3, seeking to provide a theoretical framew...
Changbin Yu, Julien M. Hendrickx, Baris Fidan, Bri...
EMNLP
2007
14 years 11 months ago
Lexical Semantic Relatedness with Random Graph Walks
Many systems for tasks such as question answering, multi-document summarization, and information retrieval need robust numerical measures of lexical relatedness. Standard thesauru...
Thad Hughes, Daniel Ramage
CVPR
2011
IEEE
14 years 6 months ago
Auto Directed Video Stabilization with Robust L1 Optimal Camera Paths
We present a novel algorithm for automatically applying constrainable, L1-optimal camera paths to generate stabilized videos by removing undesired motions. Our goal is to compute ...
Matthias Grundmann, Vivek Kwatra, Irfan Essa
FCT
1995
Springer
15 years 1 months ago
Fast Algorithms for Maintaining Shortest Paths in Outerplanar and Planar Digraphs
Abstract. We present algorithms for maintaining shortest path information in dynamic outerplanar digraphs with sublogarithmic query time. By choosing appropriate parameters we achi...
Hristo Djidjev, Grammati E. Pantziou, Christos D. ...
FSTTCS
2005
Springer
15 years 3 months ago
The Directed Planar Reachability Problem
We investigate the s-t-connectivity problem for directed planar graphs, which is hard for L and is contained in NL but is not known to be complete. We show that this problem is log...
Eric Allender, Samir Datta, Sambuddha Roy