3875 search results - page 456 / 775 » Approximation algorithms for the 0-extension problem |
216
click to vote
VLDB
2011
ACM
15 years 1 months ago
2011
ACM
Uncertain data is inherent in a few important applications such as environmental surveillance and mobile object tracking. Top-k queries (also known as ranking queries) are often n...
170
click to vote
INFOCOM
2010
IEEE
15 years 5 months ago
2010
IEEE
Abstract—When forwarding packets in the Internet, Autonomous Systems (ASes) frequently choose the shortest path in their network to the next-hop AS in the BGP path, a strategy kn...
163
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
—We consider a wireless network of n nodes that communicate over a common wireless medium under some interference constraints. Our work is motivated by the need for an efficient...
188
click to vote
UAI
2001
15 years 8 months ago
2001
We present an iterative Markov chain Monte Carlo algorithm for computing reference priors and minimax risk for general parametric families. Our approach uses MCMC techniques based...
206
click to vote
DIALM
2005
ACM
15 years 8 months ago
2005
ACM
Reducing interference is one of the main challenges in wireless communication, and particularly in ad hoc networks. The amount of interference experienced by a node v corresponds ...