Sciweavers

424 search results - page 17 / 85
» Modelling and Evaluation of CCN-Caching Trees
Sort
View
SRDS
1998
IEEE
14 years 1 months ago
Practical Parallel Algorithms for Minimum Spanning Trees
We study parallel algorithms for computing the minimum spanning tree of a weighted undirected graph G with n vertices and m edges. We consider an input graph G with m=n p, where p...
Frank K. H. A. Dehne, Silvia Götz
INFOCOM
2007
IEEE
14 years 3 months ago
On the Performance of Multiple-Tree-Based Peer-to-Peer Live Streaming
— In this paper we propose and analyze a generalized multiple-tree-based overlay architecture for peer-to-peer live streaming that employs multipath transmission and forward erro...
György Dán, Viktória Fodor, Ili...
AAAI
2004
13 years 10 months ago
Making Argumentation More Believable
There are a number of frameworks for modelling argumentation in logic. They incorporate a formal representation of individual arguments and techniques for comparing conflicting ar...
Anthony Hunter
WOWMOM
2005
ACM
138views Multimedia» more  WOWMOM 2005»
14 years 2 months ago
A Scenario-Based Performance Evaluation of Multicast Routing Protocols for Ad Hoc Networks
Current ad hoc multicast routing protocols have been designed to build and maintain a tree or mesh in the face of a mobile environment, with fast reaction to network changes in or...
Manoj Pandey, Daniel Zappala
ACJ
2006
85views more  ACJ 2006»
13 years 8 months ago
Tree Automata for Schema-Level Filtering of XML Associations
In this paper we present query filtering techniques based on bottom-up tree automata for XML access control. In our authorization model (RXACL), RDF statements are used to represen...
Vaibhav Gowadia, Csilla Farkas