Sciweavers

384 search results - page 7 / 77
» On s-hamiltonian-connected line graphs
Sort
View
AI
1998
Springer
13 years 7 months ago
Utility-Based On-Line Exploration for Repeated Navigation in an Embedded Graph
In this paper, we address the tradeo between exploration and exploitation for agents which need to learn more about the structure of their environment in order to perform more e e...
Shlomo Argamon-Engelson, Sarit Kraus, Sigalit Sina
CPM
2001
Springer
130views Combinatorics» more  CPM 2001»
13 years 12 months ago
On-Line Construction of Compact Directed Acyclic Word Graphs
Directed Acyclic Word Graph (DAWG) is a space efficient data structure that supports indices of a string. Compact Directed Acyclic Word Graph (CDAWG) is a more space efficient vari...
Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohar...
CDC
2010
IEEE
122views Control Systems» more  CDC 2010»
13 years 2 months ago
A lower bound for distributed averaging algorithms on the line graph
We derive lower bounds on the convergence speed of a widely used class of distributed averaging algorithms. In particular, we prove that any distributed averaging algorithm whose ...
Alexander Olshevsky, John N. Tsitsiklis
IPPS
1999
IEEE
13 years 11 months ago
Sparse Hypercube: A Minimal k-Line Broadcast Graph
This paper proposes a method for reducing the maximum degree of vertices in graphs that maintain optimal broadcast time when a vertex can call a vertex at distance at most k durin...
Satoshi Fujita, Arthur M. Farley
ACCV
2010
Springer
13 years 2 months ago
Network Connectivity via Inference over Curvature-Regularizing Line Graphs
Abstract. Diffusion Tensor Imaging (DTI) provides estimates of local directional information regarding paths of white matter tracts in the human brain. An important problem in DTI ...
Maxwell D. Collins, Vikas Singh, Andrew L. Alexand...