Sciweavers

4074 search results - page 418 / 815
» Abstract Graph Transformation
Sort
View
TVCG
2010
147views more  TVCG 2010»
15 years 5 months ago
"behaviorism": a framework for dynamic data visualization
— While a number of information visualization software frameworks exist, creating new visualizations, especially those that involve novel visualization metaphors, interaction tec...
Angus Forbes, Tobias Höllerer, George Legrady
CORR
2011
Springer
202views Education» more  CORR 2011»
15 years 1 months ago
High Degree Vertices, Eigenvalues and Diameter of Random Apollonian Networks
ABSTRACT. Upon the discovery of power laws [8, 16, 30], a large body of work in complex network analysis has focused on developing generative models of graphs which mimick real-wor...
Alan M. Frieze, Charalampos E. Tsourakakis
TON
2010
196views more  TON 2010»
15 years 1 months ago
Fast Recovery From Dual-Link or Single-Node Failures in IP Networks Using Tunneling
Abstract--This paper develops novel mechanisms for recovering from failures in IP networks with proactive backup path calculations and IP tunneling. The primary scheme provides res...
Shrinivasa Kini, S. Ramasubramanian, Amund Kvalbei...
WSDM
2009
ACM
191views Data Mining» more  WSDM 2009»
16 years 1 months ago
Generating labels from clicks
The ranking function used by search engines to order results is learned from labeled training data. Each training point is a (query, URL) pair that is labeled by a human judge who...
Rakesh Agrawal, Alan Halverson, Krishnaram Kenthap...
AICCSA
2007
IEEE
124views Hardware» more  AICCSA 2007»
16 years 1 months ago
The Maximum Common Subgraph Problem: Faster Solutions via Vertex Cover
In the maximum common subgraph (MCS) problem, we are given a pair of graphs and asked to find the largest induced subgraph common to them both. With its plethora of applications,...
Faisal N. Abu-Khzam, Nagiza F. Samatova, Mohamad A...