2421 search results - page 403 / 485 » Approximate Flow-Aware Networking |
189
click to vote
JMLR
2012
13 years 4 months ago
2012
We consider the task of estimating, from observed data, a probabilistic model that is parameterized by a finite number of parameters. In particular, we are considering the situat...
151
Voted
KDD
2012
ACM
13 years 4 months ago
2012
ACM
We study a novel clustering problem in which the pairwise relations between objects are categorical. This problem can be viewed as clustering the vertices of a graph whose edges a...
123
click to vote
TON
2012
13 years 4 months ago
2012
—The inherent measurement support in routers (SNMP counters or NetFlow) is not sufficient to diagnose performance problems in IP networks, especially for flow-specific problem...
124
click to vote
FOCS
2009
IEEE
15 years 9 months ago
2009
IEEE
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
117
click to vote
COMPGEOM
2006
ACM
15 years 8 months ago
2006
ACM
We consider a class of geometric facility location problems in which the goal is to determine a set X of disks given by their centers (tj) and radii (rj) that cover a given set of...