Sciweavers

1498 search results - page 77 / 300
» Collection tree protocol
Sort
View
OOPSLA
1995
Springer
15 years 6 months ago
How and Why to Encapsulate Class Trees
eusable framework, pattern or module interface usually is represented by abstract They form an abstract design and leave the implementation to concrete subclasses. ract design is ...
Dirk Riehle
SIGMETRICS
1987
ACM
102views Hardware» more  SIGMETRICS 1987»
15 years 5 months ago
Delay Analysis of a Window Tree Conflict Resolution Algorithm in a Local Area Network Environment
Expressions are found for the throughput and delay performance of a Tree Conflict Resolution Algorithm that is used in a Local Area Network with carrier sensing (and possibly also ...
George C. Polyzos, Mart Molle
132
Voted
COMPGEOM
2000
ACM
15 years 6 months ago
When crossings count - approximating the minimum spanning tree
We present an (1+ε)-approximation algorithm for computing the minimum-spanning tree of points in a planar arrangement of lines, where the metric is the number of crossings betwee...
Sariel Har-Peled, Piotr Indyk
GRAMMARS
2000
89views more  GRAMMARS 2000»
15 years 2 months ago
Monotonic C-Command: A New Perspective on Tree Adjoining Grammar
In this paper we argue for a reconceptualization of the Tree Adjoining Grammar (TAG) formalism, in which the elementary structures are collections of c-command relations, and the ...
Robert Frank, Seth Kulick, K. Vijay-Shanker
SDMW
2004
Springer
15 years 7 months ago
Secure and Privacy Preserving Outsourcing of Tree Structured Data
With the increasing use of web services, many new challenges concerning data security are becoming critical. Data or applications can now be outsourced to powerful remote servers, ...
Ping Lin, K. Selçuk Candan