3708 search results - page 257 / 742 » Approximating Betweenness Centrality |
155
click to vote
DMSN
2004
ACM
16 years 1 days ago
2004
ACM
Recent years have witnessed an increasing interest in filtering of distributed data streams, such as those produced by networked sensors. The focus is to conserve bandwidth and se...
160
click to vote
ISAAC
2004
Springer
15 years 12 months ago
2004
Springer
Assuming 3-SAT formulas are hard to refute with high probability, Feige showed approximation hardness results, among others for the max bipartite clique. We extend this result in t...
193
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
We consider the classical vertex cover and set cover problems with the addition of hard capacity constraints. This means that a set (vertex) can only cover a limited number of its...
191
click to vote
EUROCOLT
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. Recent works have shown the advantage of using Active Learning methods, such as the Query by Committee (QBC) algorithm, to various learning problems. This class of Algori...
149
click to vote
DCOSS
2007
Springer
15 years 10 months ago
2007
Springer
The exposure of a path p is a measure of the likelihood that an object traveling along p is detected by a network of sensors and it is formally defined as an integral over all poin...