Sciweavers

7 search results - page 1 / 2
» A characterization of triangle-free tolerance graphs
Sort
View
DAM
2006
88views more  DAM 2006»
13 years 4 months ago
A characterization of triangle-free tolerance graphs
We prove that a triangle-free graph G is a tolerance graph if and only if there exists a set of consecutively ordered stars that partition the edges of G. Since tolerance graphs a...
Arthur H. Busch
CCS
2009
ACM
14 years 5 months ago
Unconditionally secure message transmission in arbitrary directed synchronous networks tolerating generalized mixed adversary
In this paper, we re-visit the problem of unconditionally secure message transmission (USMT) from a sender S to a receiver R, who are part of a distributed synchronous network, mo...
Kannan Srinathan, Arpita Patra, Ashish Choudhary, ...
TCSV
2008
175views more  TCSV 2008»
13 years 4 months ago
Expandable Data-Driven Graphical Modeling of Human Actions Based on Salient Postures
This paper presents a graphical model for learning and recognizing human actions. Specifically, we propose to encode actions in a weighted directed graph, referred to as action gra...
Wanqing Li, Zhengyou Zhang, Zicheng Liu
WIOPT
2010
IEEE
13 years 3 months ago
Hub-betweenness analysis in delay tolerant networks inferred by real traces
—In this paper we study the influence of using hub nodes to relay messages in human-based delay tolerant networks (DTNs), by analyzing empirical traces obtained by human mobilit...
Giuliano Grossi, Federico Pedersini
SIAMDM
2010
149views more  SIAMDM 2010»
13 years 3 months ago
Formal Theory of Noisy Sensor Network Localization
Graph theory has been used to characterize the solvability of the sensor network localization problem. If sensors correspond to vertices and edges correspond to sensor pairs betwee...
Brian D. O. Anderson, Iman Shames, Guoqiang Mao, B...