1480 search results - page 186 / 296 » Distributed algorithms for weighted problems in sparse graph... |
111
Voted
MOBIHOC
2006
ACM
16 years 11 days ago
2006
ACM
Localization is an important and extensively studied problem in ad-hoc wireless sensor networks. Given the connectivity graph of the sensor nodes, along with additional local info...
CP
2000
Springer
15 years 5 months ago
2000
Springer
Abstract. Variable elimination is the basic step of Adaptive Consistency 4 . It transforms the problem into an equivalent one, having one less variable. Unfortunately, there are ma...
115
click to vote
KDD
2010
ACM
14 years 10 months ago
2010
ACM
The problem of graph classification has attracted great interest in the last decade. Current research on graph classification assumes the existence of large amounts of labeled tra...
152
Voted
DCOSS
2008
Springer
15 years 2 months ago
2008
Springer
We present the first local approximation schemes for maximum independent set and minimum vertex cover in unit disk graphs. In the graph model we assume that each node knows its geo...
100
Voted
NIPS
1994
15 years 2 months ago
1994
We present efficient algorithms for dealing with the problem of missing inputs (incomplete feature vectors) during training and recall. Our approach is based on the approximation ...