Sciweavers

199 search results - page 8 / 40
» A large time-aware web graph
Sort
View
ESA
2009
Springer
149views Algorithms» more  ESA 2009»
14 years 2 months ago
Sparse Cut Projections in Graph Streams
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...
Atish Das Sarma, Sreenivas Gollapudi, Rina Panigra...
BMCBI
2006
137views more  BMCBI 2006»
13 years 7 months ago
INTEGRATOR: interactive graphical search of large protein interactomes over the Web
Background: The rapid growth of protein interactome data has elevated the necessity and importance of network analysis tools. However, unlike pure text data, network search spaces...
Aaron N. Chang, Jason McDermott, Zachary Frazier, ...
CHI
2011
ACM
12 years 11 months ago
Guess who?: enriching the social graph through a crowdsourcing game
Despite the tremendous popularity of social network sites both on the web and within enterprises, the relationship information they contain may be often incomplete or outdated. We...
Ido Guy, Adam Perer, Tal Daniel, Ohad Greenshpan, ...
SAMT
2009
Springer
180views Multimedia» more  SAMT 2009»
14 years 2 months ago
RelFinder: Revealing Relationships in RDF Knowledge Bases
Abstract. The Semantic Web has recently seen a rise of large knowledge bases (such as DBpedia) that are freely accessible via SPARQL endpoints. The structured representation of the...
Philipp Heim, Sebastian Hellmann, Jens Lehmann, St...
ICS
2010
Tsinghua U.
14 years 4 months ago
Local Algorithms for Finding Interesting Individuals in Large Networks
: We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties -- such as high degree or clustering coefficient -- in large so...
Mickey Brautbar, Michael Kearns