Sciweavers

2304 search results - page 201 / 461
» On the Vulnerability of Large Graphs
Sort
View
SDM
2008
SIAM
139views Data Mining» more  SDM 2008»
15 years 8 months ago
Proximity Tracking on Time-Evolving Bipartite Graphs
Given an author-conference network that evolves over time, which are the conferences that a given author is most closely related with, and how do they change over time? Large time...
Hanghang Tong, Spiros Papadimitriou, Philip S. Yu,...
NAACL
2007
15 years 8 months ago
Unsupervised Natural Language Processing Using Graph Models
In the past, NLP has always been based on the explicit or implicit use of linguistic knowledge. In classical computer linguistic applications explicit rule based approaches prevai...
Chris Biemann
APVIS
2004
15 years 8 months ago
Adding Filtering to Geometric Distortion to Visualize a Clustered Graph on Small Screens.
Presenting large amounts of information in a limited screen space is a significant challenge in the field of Information Visualization. With the rapid development and growing use ...
Wanchun Li, Masahiro Takatsuka
COR
2010
146views more  COR 2010»
15 years 6 months ago
A search space "cartography" for guiding graph coloring heuristics
We present a search space analysis and its application in improving local search algorithms for the graph coloring problem. Using a classical distance measure between colorings, w...
Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz
CN
2008
108views more  CN 2008»
15 years 6 months ago
Finding a dense-core in Jellyfish graphs
The connectivity of the Internet crucially depends on the relationships between thousands of Autonomous Systems (ASes) that exchange routing information using the Border Gateway P...
Mira Gonen, Dana Ron, Udi Weinsberg, Avishai Wool