Sciweavers

4052 search results - page 699 / 811
» Using RDF to describe networks
Sort
View
TSP
2010
14 years 4 months ago
Optimization and analysis of distributed averaging with short node memory
Distributed averaging describes a class of network algorithms for the decentralized computation of aggregate statistics. Initially, each node has a scalar data value, and the goal...
Boris N. Oreshkin, Mark Coates, Michael G. Rabbat
ICCV
2005
IEEE
15 years 12 months ago
Efficient Learning of Relational Object Class Models
We present an efficient method for learning part-based object class models from unsegmented images represented as sets of salient features. A model includes parts' appearance...
Aharon Bar-Hillel, Tomer Hertz, Daphna Weinshall
MOBICOM
2004
ACM
15 years 3 months ago
Analyzing the spread of active worms over VANET
Interactive communications among nodes in Vehicular Ad Hoc Networks (VANET) and the safety-oriented nature of many VANET applications necessitate a robust security framework. An a...
Syed A. Khayam, Hayder Radha
INFOCOM
2003
IEEE
15 years 3 months ago
Internet Quarantine: Requirements for Containing Self-Propagating Code
— It has been clear since 1988 that self-propagating code can quickly spread across a network by exploiting homogeneous security vulnerabilities. However, the last few years have...
David Moore, Colleen Shannon, Geoffrey M. Voelker,...
RE
1997
Springer
15 years 2 months ago
Requirements Models in Context
The field of requirements engineering emerges out of tradition of research and engineering practice that stresses rtance of generalizations and abstractions. abstraction is essent...
Colin Potts