2421 search results - page 150 / 485 » Approximate Flow-Aware Networking |
131
click to vote
STOC
2009
ACM
16 years 4 months ago
2009
ACM
Consider the edge-connectivity survivable network design problem: given a graph G = (V, E) with edge-costs, and edgeconnectivity requirements rij Z0 for every pair of vertices i,...
136
click to vote
WWW
2010
ACM
15 years 10 months ago
2010
ACM
Detecting clusters or communities in large real-world graphs such as large social or information networks is a problem of considerable interest. In practice, one typically chooses...
142
Voted
STOC
2006
ACM
16 years 3 months ago
2006
ACM
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
130
Voted
FLAIRS
2007
15 years 5 months ago
2007
POMDPs are a popular framework for representing decision making problems that contain uncertainty. The high computational complexity of finding exact solutions to POMDPs has spaw...
136
click to vote
NIPS
2008
15 years 4 months ago
2008
We present a sparse approximation approach for dependent output Gaussian processes (GP). Employing a latent function framework, we apply the convolution process formalism to estab...