Sciweavers

2304 search results - page 121 / 461
» On the Vulnerability of Large Graphs
Sort
View
180
Voted
TVCG
2010
165views more  TVCG 2010»
15 years 4 months ago
A Visual Backchannel for Large-Scale Events
—We introduce the concept of a Visual Backchannel as a novel way of following and exploring online conversations about large-scale events. Microblogging communities, such as Twit...
Marian Dörk, Daniel M. Gruen, Carey Williamso...
DM
1998
62views more  DM 1998»
15 years 5 months ago
Bipartite subgraphs of integer weighted graphs
For every integer p > 0 let f(p) be the minimum possible value of the maximum weight of a cut in an integer weighted graph with total weight p. It is shown that for every large...
Noga Alon, Eran Halperin
161
Voted
SDM
2010
SIAM
115views Data Mining» more  SDM 2010»
15 years 7 months ago
Radius Plots for Mining Tera-byte Scale Graphs: Algorithms, Patterns, and Observations
Given large, multi-million node graphs (e.g., FaceBook, web-crawls, etc.), how do they evolve over time? How are they connected? What are the central nodes and the outliers of the...
U. Kang, Charalampos E. Tsourakakis, Ana Paula App...
JGAA
2007
135views more  JGAA 2007»
15 years 6 months ago
Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Dat
Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...
Donatello Conte, Pasquale Foggia, Mario Vento
ICDE
2009
IEEE
184views Database» more  ICDE 2009»
16 years 28 days ago
Scalable Keyword Search on Large Data Streams
Abstract— It is widely realized that the integration of information retrieval (IR) and database (DB) techniques provides users with a broad range of high quality services. A new ...
Lu Qin, Jeffrey Xu Yu, Lijun Chang, Yufei Tao