625 search results - page 80 / 125 » Approximating Travel Times Using Opportunistic Networking |
117
click to vote
CDC
2009
IEEE
14 years 11 months ago
2009
IEEE
In many applicative scenarios it is important to derive information about the topology and the internal connections of more dynamical systems interacting together. Examples can be ...
114
click to vote
INFOCOM
2009
IEEE
15 years 8 months ago
2009
IEEE
Abstract—We propose a novel search mechanism for unstructured p2p networks, and show that it is both scalable, i.e., it leads to a bounded query traffic load per peer as the pee...
105
click to vote
APIN
2005
15 years 1 months ago
2005
This paper presents an extension of Petri net framework with imprecise temporal properties. We use possibility theory to represent imprecise time by time-stamping tokens and assig...
JMMA
2002
15 years 1 months ago
2002
Abstract. Multiresolution representation of quadrilateral surface approximation (MRQSA) is a useful representation for progressive graphics transmission in networks. Based on two r...
144
click to vote
PODS
2006
ACM
16 years 2 months ago
2006
ACM
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...