3637 search results - page 458 / 728 » Application of Network Calculus to Guaranteed Service Networ... |
251
click to vote
TMC
2008
15 years 7 months ago
2008
A k-hop dominating set is a subset of nodes such that each node not in the set can be reached within k hops from at least one node in the set. A connected k-hop dominating set can ...
164
click to vote
ICML
2010
IEEE
15 years 8 months ago
2010
IEEE
We introduce a natural generalization of submodular set cover and exact active learning with a finite hypothesis class (query learning). We call this new problem interactive submo...
209
click to vote
IADIS
2004
15 years 8 months ago
2004
Currently providing such features in mobile applications as the sending of lower-bandwidth images when a client device is in a low-bandwidth access area, the business logic to dis...
319
click to vote
SIGMOD
2009
ACM
16 years 7 months ago
2009
ACM
This paper addresses the problem of monitoring the k nearest neighbors to a dynamically changing path in road networks. Given a destination where a user is going to, this new quer...
247
click to vote
WPES
2006
ACM
16 years 1 months ago
2006
ACM
Many applications of mix networks such as anonymous Web browsing require relationship anonymity: it should be hard for the attacker to determine who is communicating with whom. Co...