Sciweavers

3396 search results - page 160 / 680
» Tree representations of graphs
Sort
View
INFOCOM
2008
IEEE
14 years 3 months ago
Multicast Tree Diameter for Dynamic Distributed Interactive Applications
Abstract—Latency reduction in distributed interactive applications has been studied intensively. Such applications may have stringent latency requirements and dynamic user groups...
Knut-Helge Vik, Pål Halvorsen, Carsten Griwo...
EDBT
2010
ACM
138views Database» more  EDBT 2010»
14 years 1 months ago
How to authenticate graphs without leaking
Secure data sharing in multi-party environments requires that both authenticity and confidentiality of the data be assured. Digital signature schemes are commonly employed for au...
Ashish Kundu, Elisa Bertino
SDM
2008
SIAM
256views Data Mining» more  SDM 2008»
13 years 10 months ago
Graph Mining with Variational Dirichlet Process Mixture Models
Graph data such as chemical compounds and XML documents are getting more common in many application domains. A main difficulty of graph data processing lies in the intrinsic high ...
Koji Tsuda, Kenichi Kurihara
KSEM
2007
Springer
14 years 3 months ago
A Diagrammatic Reasoning System for ALC
Abstract. Description logics (DLs) are a well-known family of knowledge representation (KR) languages. The notation of DLs has the style of a variable-free first order predicate l...
Frithjof Dau, Peter W. Eklund
WDAG
2007
Springer
162views Algorithms» more  WDAG 2007»
14 years 3 months ago
A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree
Communication in networks suffers if a link fails. When the links are edges of a tree that has been chosen from an underlying graph of all possible links, a broken link even disco...
Beat Gfeller, Nicola Santoro, Peter Widmayer