Sciweavers

828 search results - page 117 / 166
» Simplicial Powers of Graphs
Sort
View
TVCG
2008
103views more  TVCG 2008»
13 years 7 months ago
Who Votes For What? A Visual Query Language for Opinion Data
Surveys and opinion polls are extremely popular in the media, especially in the months preceding a general election. However, the available tools for analyzing poll results often r...
Geoffrey M. Draper, Richard F. Riesenfeld
DC
2002
13 years 7 months ago
Restoration by path concatenation: fast recovery of MPLS paths
A new general theory about restoration of network paths is first introduced. The theory pertains to restoration of shortest paths in a network following failure, e.g., we prove th...
Yehuda Afek, Anat Bremler-Barr, Haim Kaplan, Edith...
IJDSN
2008
81views more  IJDSN 2008»
13 years 7 months ago
A Flexible Stochastic Automaton-Based Algorithm for Network Self-Partitioning
This article proposes a flexible and distributed stochastic automaton-based network partitioning algorithm that is capable of finding the optimal k-way partition with respect to a...
Yan Wan, Sandip Roy, Ali Saberi, Bernard C. Lesieu...
ECCC
2010
92views more  ECCC 2010»
13 years 6 months ago
Logspace Versions of the Theorems of Bodlaender and Courcelle
Bodlaender’s Theorem states that for every k there is a linear-time algorithm that decides whether an input graph has tree width k and, if so, computes a width-k tree compositio...
Michael Elberfeld, Andreas Jakoby, Till Tantau
EJIVP
2010
107views more  EJIVP 2010»
13 years 2 months ago
Unsupervised Action Classification Using Space-Time Link Analysis
Abstract--In this paper we address the problem of unsupervised discovery of action classes in video data. Different from all existing methods thus far proposed for this task, we pr...
Haowei Liu, Rogerio Feris, Volker Krüger, Min...