Sciweavers

909 search results - page 139 / 182
» On the approximability of some network design problems
Sort
View
INFOCOM
2002
IEEE
15 years 6 months ago
FPAC: Fast, Fixed-Cost Authentication for Access to Reserved Resources
—Enhanced network services often involve allocating resources (bandwidth/buffer space) preferentially to packets belonging to certain flows or traffic classes. Such services ar...
Kenneth L. Calvert, Srinivasan Venkatraman, Jim Gr...
CIKM
2009
Springer
15 years 8 months ago
Privacy-enhanced public view for social graphs
We consider the problem of releasing a limited public view of a sensitive graph which reveals at least k edges per node. We are motivated by Facebook’s public search listings, w...
Hyoungshick Kim, Joseph Bonneau
NEUROSCIENCE
2001
Springer
15 years 6 months ago
Analysis and Synthesis of Agents That Learn from Distributed Dynamic Data Sources
We propose a theoretical framework for specification and analysis of a class of learning problems that arise in open-ended environments that contain multiple, distributed, dynamic...
Doina Caragea, Adrian Silvescu, Vasant Honavar
IJVR
2007
100views more  IJVR 2007»
15 years 1 months ago
The Impact of Social Interaction on Usability for Distributed Virtual Environments
—Distance collaboration has long been a research area for distributed Virtual Environments (VEs). In these environments people interact with the technology and each other in a co...
Ilona Heldal
MOBICOM
2000
ACM
15 years 5 months ago
Caching strategies in on-demand routing protocols for wireless ad hoc networks
An on-demand routing protocol for wireless ad hoc networks is one that searches for and attempts to discover a route to some destination node only when a sending node originates a...
Yih-Chun Hu, David B. Johnson