Results 1  10
of
4,714
Hierarchical edge bundles: Visualization of adjacency relations in hierarchical data
 IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS
, 2006
"... A compound graph is a frequently encountered type of data set. Relations are given between items, and a hierarchy is defined on the items as well. We present a new method for visualizing such compound graphs. Our approach is based on visually bundling the adjacency edges, i.e., nonhierarchical edge ..."
Abstract

Cited by 271 (12 self)
 Add to MetaCart
bundling reduces visual clutter and also visualizes implicit adjacency edges between parent nodes that are the result of explicit adjacency edges between their respective child nodes. Furthermore, hierarchical edge bundling is a generic method which can be used in conjunction with existing tree
Explicit Allocation of BestEffort Packet Delivery Service
, 1998
"... This paper presents the “allocatedcapacity” framework for providing different levels of besteffort service in times of network congestion. The “allocatedcapacity” framework—extensions to the Internet protocols and algorithms—can allocate bandwidth to different users in a controlled and predictable ..."
Abstract

Cited by 467 (2 self)
 Add to MetaCart
the network resources. We focus on algorithms for essential components of the framework: a differential dropping algorithm for network routers and a tagging algorithm for profile meters at the edge of the network for bulkdata transfers. We present simulation results to illustrate the effectiveness
A distributed algorithm for minimumweight spanning trees
, 1983
"... A distributed algorithm is presented that constructs he minimumweight spanning tree in a connected undirected graph with distinct edge weights. A processor exists at each node of the graph, knowing initially only the weights of the adjacent edges. The processors obey the same algorithm and exchange ..."
Abstract

Cited by 435 (3 self)
 Add to MetaCart
A distributed algorithm is presented that constructs he minimumweight spanning tree in a connected undirected graph with distinct edge weights. A processor exists at each node of the graph, knowing initially only the weights of the adjacent edges. The processors obey the same algorithm
A logic of implicit and explicit belief
 In Proceedings of the National Conference on Artificial Intelligence (AAAI’84
, 1984
"... As part of an ongoing project to understand the found* tions of Knowledge Representation, we are attempting to characterize a kind of belief that forms a more appropriate basis for Knowledge Representation systems than that cap tured by the usual possibleworld formalizations begun by Hintikka. In ..."
Abstract

Cited by 315 (8 self)
 Add to MetaCart
such as ‘Know!edge Representation ” or “knowledge base ” has never been adequately characterized. r As we discuss below, the major existing formal model of belief (originated by Hintikka in [l]) requires the
An optimal graph theoretic approach to data clustering: Theory and its application to image segmentation
 IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 1993
"... A novel graph theoretic approach for data clustering is presented and its application to the image segmentation problem is demonstrated. The data to be clustered are represented by an undirected adjacency graph G with arc capacities assigned to reflect the similarity between the linked vertices. Cl ..."
Abstract

Cited by 360 (0 self)
 Add to MetaCart
A novel graph theoretic approach for data clustering is presented and its application to the image segmentation problem is demonstrated. The data to be clustered are represented by an undirected adjacency graph G with arc capacities assigned to reflect the similarity between the linked vertices
Topological Simultaneous Localization and Mapping (SLAM): Toward Exact Localization Without Explicit Localization
 IEEE Transactions on Robotics and Automation
, 2001
"... One of the critical components of mapping an unknown environment is the robot's ability to locate itself on a partially explored map. This becomes challenging when the robot experiences positioning error, does not have an external positioning device, nor the luxury of engineered landmarks place ..."
Abstract

Cited by 224 (10 self)
 Add to MetaCart
map used in this paper is the generalized Voronoi graph (GVG), which also encodes some metric information about the robot's environment, as well. In this paper, we present the lowlevel control laws that generate the GVG edges and nodes, thereby allowing for exploration of an unknown space
On Orthogonal and Symplectic Matrix Ensembles
 MATHEMATICAL PHYSICS
, 1996
"... The focus of this paper is on the probability, Eβ(Q; J), that a set J consisting of a finite union of intervals contains no eigenvalues for the finite N Gaussian Orthogonal (β = 1) and Gaussian Symplectic (β = 4) Ensembles and their respective scaling limits both in the bulk and at the edge of the ..."
Abstract

Cited by 259 (10 self)
 Add to MetaCart
of the spectrum. We show how these probabilities can be expressed in terms of quantities arising in the corresponding unitary (β = 2) ensembles. Our most explicit new results concern the distribution of the largest eigenvalue in each of these ensembles. In the edge scaling limit we show that these largest
Dual Contouring of Hermite Data
, 2002
"... This paper describes a new method for contouring a signed grid whose edges are tagged by Hermite data (exact intersection points and normals). This method avoids the need to explicitly identify and process "features" as required in previous Hermite contouring methods. We extend this contou ..."
Abstract

Cited by 258 (15 self)
 Add to MetaCart
This paper describes a new method for contouring a signed grid whose edges are tagged by Hermite data (exact intersection points and normals). This method avoids the need to explicitly identify and process "features" as required in previous Hermite contouring methods. We extend
Centertrack: An IP overlay network for tracking DoS floods
 In Proceedings of USENIX Security Symposium’2000
, 2000
"... Finding the source of forged Internet Protocol (IP) datagrams in a large, highspeed network is difficult due to the design of the IP protocol and the lack of sufficient capability in most highspeed, highcapacity router implementations. Typically, not enough of the routers in such a network are cap ..."
Abstract

Cited by 254 (0 self)
 Add to MetaCart
, that is used to selectively reroute interesting datagrams directly from edge routers to special tracking routers. The tracking routers, or associated sniffers, can easily determine the ingress edge router by observing from which tunnel the datagrams arrive. The datagrams can be examined, then dropped
Regular and Irregular Progressive EdgeGrowth Tanner Graphs
 IEEE TRANS. INFORM. THEORY
, 2003
"... We propose a general method for constructing Tanner graphs having a large girth by progressively establishing edges or connections between symbol and check nodes in an edgebyedge manner, called progressive edgegrowth (PEG) construction. Lower bounds on the girth of PEG Tanner graphs and on the mi ..."
Abstract

Cited by 193 (0 self)
 Add to MetaCart
We propose a general method for constructing Tanner graphs having a large girth by progressively establishing edges or connections between symbol and check nodes in an edgebyedge manner, called progressive edgegrowth (PEG) construction. Lower bounds on the girth of PEG Tanner graphs
Results 1  10
of
4,714