1480 search results - page 64 / 296 » Distributed algorithms for weighted problems in sparse graph... |
114
Voted
ICIP
2007
IEEE
16 years 2 months ago
2007
IEEE
Recently, `entry/exit' events of objects in the field-of-views of cameras were used to learn the topology of the camera network. The integration of object appearance was also...
114
Voted
SC
2005
ACM
15 years 6 months ago
2005
ACM
Many emerging large-scale data science applications require searching large graphs distributed across multiple memories and processors. This paper presents a distributed breadthï¬...
104
click to vote
SODA
2004
ACM
15 years 2 months ago
2004
ACM
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...
155
Voted
GECCO
2003
Springer
15 years 6 months ago
2003
Springer
Abstract. A brachistochrone is the path along which a weighted particle falls most quickly from one point to another, and a catenary is the smooth curve connecting two points whose...
109
Voted
CORR
2007
Springer
15 years 21 days ago
2007
Springer
We consider the problem of estimating the parameters of a Gaussian or binary distribution in such a way that the resulting undirected graphical model is sparse. Our approach is to...