1480 search results - page 24 / 296 » Distributed algorithms for weighted problems in sparse graph... |
COLING
2008
13 years 9 months ago
2008
This paper describes a parameter estimation method for multi-label classification that does not rely on approximate inference. It is known that multi-label classification involvin...
SPAA
2006
ACM
14 years 1 months ago
2006
ACM
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
ESA
2009
Springer
14 years 2 months ago
2009
Springer
Finding sparse cuts is an important tool for analyzing large graphs that arise in practice, such as the web graph, online social communities, and VLSI circuits. When dealing with s...
SODA
2001
ACM
13 years 9 months ago
2001
ACM
Markov networks are a common class of graphical models used in machine learning. Such models use an undirected graph to capture dependency information among random variables in a ...
INFOCOM
2006
IEEE
14 years 1 months ago
2006
IEEE
— We propose efficient distributed algorithms to aid navigation of a user through a geographic area covered by sensors. The sensors sense the level of danger at their locations ...