3708 search results - page 456 / 742 » Approximating Betweenness Centrality |
165
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
The k-forest problem is a common generalization of both the k-MST and the dense-k-subgraph problems. Formally, given a metric space on n vertices V , with m demand pairs ⊆ V × ...
205
click to vote
ICCV
2005
IEEE
16 years 8 months ago
2005
IEEE
We present an efficient method for learning part-based object class models from unsegmented images represented as sets of salient features. A model includes parts' appearance...
208
click to vote
KDD
2006
ACM
16 years 7 months ago
2006
ACM
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
204
click to vote
PERCOM
2005
ACM
16 years 6 months ago
2005
ACM
In the rapidly developing field of sensor networks, bridging the gap between the applications and the hardware presents a major challenge. Although middleware is one solution, it ...
191
click to vote
MOBISYS
2004
ACM
16 years 6 months ago
2004
ACM
Wireless data broadcast has received a lot of attention from industries and academia in recent years. Access efficiency and energy conservation are two critical performance concer...