2004 search results - page 160 / 401 » Sampling from large graphs |
169
click to vote
JMLR
2010
15 years 1 months ago
2010
Three simple and explicit procedures for testing the independence of two multi-dimensional random variables are described. Two of the associated test statistics (L1, log-likelihoo...
206
click to vote
SPAA
2004
ACM
16 years 8 days ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
231
click to vote
INFOCOM
2008
IEEE
16 years 1 months ago
2008
IEEE
—In an n-way broadcast application each one of n overlay nodes wants to push its own distinct large data file to all other n-1 destinations as well as download their respective ...
202
click to vote
ICCV
1999
IEEE
16 years 8 months ago
1999
IEEE
In this paper we address the problem of minimizing a large class of energy functions that occur in early vision. The major restriction is that the energy function's smoothnes...
183
click to vote
ATAL
2011
Springer
14 years 6 months ago
2011
Springer
In response to the Mumbai attacks of 2008, the Mumbai police have started to schedule a limited number of inspection checkpoints on the road network throughout the city. Algorithm...