Sciweavers

2796 search results - page 335 / 560
» The coolest path problem
Sort
View
PODC
2005
ACM
16 years 3 days ago
Routing complexity of faulty networks
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
Omer Angel, Itai Benjamini, Eran Ofek, Udi Wieder
ICALP
2005
Springer
16 years 2 days ago
New Approaches for Virtual Private Network Design
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
Friedrich Eisenbrand, Fabrizio Grandoni, Gianpaolo...
INFOCOM
2010
IEEE
15 years 5 months ago
Distance Estimation by Constructing The Virtual Ruler in Anisotropic Sensor Networks
Abstract—Distance estimation is fundamental for many functionalities of wireless sensor networks and has been studied intensively in recent years. A critical challenge in distanc...
Yun Wang, Kai Li, Jie Wu
HCI
2009
15 years 4 months ago
Context-Aware Cognitive Agent Architecture for Ambient User Interfaces
An ambient user interface is a set of hidden intelligent interfaces that recognize user's presence and provides services to immediate needs. There are several research activit...
Youngho Lee, Choonsung Shin, Woontack Woo
EUROSYS
2011
ACM
14 years 10 months ago
Striking a new balance between program instrumentation and debugging time
Although they are helpful in many cases, state-of-the-art bug reporting systems may impose excessive overhead on users, leak private information, or provide little help to the dev...
Olivier Crameri, Ricardo Bianchini, Willy Zwaenepo...