Sciweavers

6480 search results - page 1090 / 1296
» Proximity Communication and Time
Sort
View
PPL
2000
110views more  PPL 2000»
15 years 7 months ago
Faulty Random Geometric Networks
In this paper we analyze the computational power of random geometric networks in the presence of random (edge or node) faults considering several important network parameters. We ...
Josep Díaz, Jordi Petit, Maria J. Serna
AC
1998
Springer
15 years 6 months ago
Natural Language Processing: A Human-Computer Interaction Perspective
Natural language processing has been in existence for more than fifty years. During this time, it has significantly contributed to the field of human-computer interaction in terms...
Bill Z. Manaris
ALGORITHMICA
1998
184views more  ALGORITHMICA 1998»
15 years 6 months ago
Approximation Algorithms for Connected Dominating Sets
The dominatingset problemin graphs asks for a minimumsize subset of vertices with the followingproperty: each vertex is required to either be in the dominating set, or adjacent to...
Sudipto Guha, Samir Khuller
CONCURRENCY
1998
130views more  CONCURRENCY 1998»
15 years 6 months ago
JPVM: network parallel computing in Java
The JPVM library is a software system for explicit message-passing based distributed memory MIMD parallel programming in Java. The library supports an interface similar to the C a...
Adam Ferrari
CN
1999
69views more  CN 1999»
15 years 6 months ago
Transport of video over partial order connections
A Partial Order and partial reliable Connection (POC) is an end-to-end transport connection authorized to deliver objects in an order that can differ from the transmitted one. Such...
Luis Rojas-Cardenas, Emmanuel Chaput, Laurent Dair...
« Prev « First page 1090 / 1296 Last » Next »