Sciweavers

717 search results - page 31 / 144
» The Viewing Graph
Sort
View
IJCNN
2008
IEEE
14 years 2 months ago
On the sample mean of graphs
— We present an analytic and geometric view of the sample mean of graphs. The theoretical framework yields efficient subgradient methods for approximating a structural mean and ...
Brijnesh J. Jain, Klaus Obermayer
CCR
2004
119views more  CCR 2004»
13 years 7 months ago
Collecting the internet AS-level topology
At the inter-domain level, the Internet topology can be represented by a graph with Autonomous Systems (ASes) as nodes and AS peerings as links. This AS-level topology graph has b...
Beichuan Zhang, Raymond A. Liu, Daniel Massey, Lix...
DSD
2003
IEEE
138views Hardware» more  DSD 2003»
14 years 27 days ago
A Two-step Genetic Algorithm for Mapping Task Graphs to a Network on Chip Architecture
Network on Chip (NoC) is a new paradigm for designing core based System on Chip which supports high degree of reusability and is scalable. In this paper we describe an efficient t...
Tang Lei, Shashi Kumar
VL
2005
IEEE
107views Visual Languages» more  VL 2005»
14 years 1 months ago
Navigating Software Architectures with Constant Visual Complexity
Abstract— Visualizing software architecture faces the challenges of both data complexity and visual complexity. This paper presents an approach for visualizing software architect...
Wanchun Li, Peter Eades, Seok-Hee Hong
MLG
2007
Springer
14 years 1 months ago
Transductive Rademacher Complexities for Learning Over a Graph
Recent investigations [12, 2, 8, 5, 6] and [11, 9] indicate the use of a probabilistic (’learning’) perspective of tasks defined on a single graph, as opposed to the traditio...
Kristiaan Pelckmans, Johan A. K. Suykens