1480 search results - page 83 / 296 » Distributed algorithms for weighted problems in sparse graph... |
ICML
2010
IEEE
13 years 11 months ago
2010
IEEE
We develop a penalized kernel smoothing method for the problem of selecting nonzero elements of the conditional precision matrix, known as conditional covariance selection. This p...
SDM
2003
SIAM
13 years 11 months ago
2003
SIAM
In earlier work we have introduced and explored a variety of different probabilistic models for the problem of answering selectivity queries posed to large sparse binary data set...
ICPR
2010
IEEE
14 years 1 months ago
2010
IEEE
Automated visual tracking of cells from video microscopy has many important biomedical applications. In this paper, we model the problem of cell tracking over pairs of video micro...
APVIS
2006
13 years 11 months ago
2006
A common problem in visualising some networks is the presence of localised high density areas in an otherwise sparse graph. Applying common graph drawing algorithms on such networ...
ICALP
2011
Springer
13 years 1 months ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...