1395 search results - page 103 / 279 » Modeling betweenness for question answering |
150
click to vote
KDD
2006
ACM
16 years 4 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.)...
KDD
1997
ACM
15 years 8 months ago
1997
ACM
Low-frequency variability in geopotential height records of the Northern Hemisphere is a topic of significance in atmospheric science, having profound implications for climate mod...
147
click to vote
PAAPP
2007
15 years 4 months ago
2007
In this paper, we present a study on video viewing behavior. Based on a well-suited Markovian model, we have developed a clustering algorithm called K-Models and inspired by the K...
128
click to vote
STOC
2010
ACM
15 years 8 months ago
2010
ACM
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
133
click to vote
MOBISYS
2010
ACM
15 years 6 months ago
2010
ACM
This paper develops a navigation service, called GreenGPS, that uses participatory sensing data to map fuel consumption on city streets, allowing drivers to find the most fueleffi...