We propose a technique for building optical packet networks that does not require any buffering, any signalling or header processing.
Indoor localization is a key enabler for pervasive computing and network optimization.
Recently, wireless mesh technology has been used for military applications and fast recovery networks, refered to as nomadic wireless mesh networks (NWMNs).
Many popular algorithms for fast packet forwarding and filtering rely on the tree data structure. Examples are trie-based IP lookup and packet classification algorithms.
One of the greatest challenges in the migration from a traditional telephony network toward a multiservices packet network is creating a packet-based infrastructure that will preserve the ubiquity,
One of the greatest challenges int he migration from a traditional telephony network towards a multi-services packet network is creating a packet-based infrastructure that will preserve the ubiquit
The semantic discontinuity between World-Wide languages (XML, XML Schema, XPath, ...) and Semantic Web languages (RDF(S) and DAML+OIL) forms a serious barrier for the stated goals of the Semantic W
This work addresses the problem of approximating a manifold by a simplicial mesh, and the related problem of building triangulations for the purpose of piecewise-linear approximation of functions.
We prove the existence of, and describe, a (random) process which builds subtrees of a rooted d-branching tree one node at a time, in such a way that the subtree created at stage n is precisely a u
1. Introduction - The C++ programming language [1] allows the provider of a new user-defined type of define the conversions between that type and another type.
