Sciweavers

5606 search results - page 353 / 1122
» Randomization Techniques for Graphs.
Sort
View
CSMR
2007
IEEE
16 years 29 days ago
Online Construction of Dynamic Object Process Graphs
A dynamic object process graph is a view on the control flow graph from the perspective of a single object. It has been shown that such a graph can be a useful starting point for...
Jochen Quante
CHI
2010
ACM
15 years 11 months ago
Clutching at straws: using tangible interaction to provide non-visual access to graphs
We present a tangible user interface (TUI) called Tangible Graph Builder, that has been designed to allow visually impaired users to access graph and chart-based data. We describe...
David K. McGookin, Euan Robertson, Stephen A. Brew...
JGAA
2006
127views more  JGAA 2006»
15 years 6 months ago
A New Algorithm for Finding Minimal Cycle-Breaking Sets of Turns in a Graph
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...
Lev B. Levitin, Mark G. Karpovsky, Mehmet Mustafa,...
TKDE
2008
154views more  TKDE 2008»
15 years 6 months ago
Analyzing the Structure and Evolution of Massive Telecom Graphs
Abstract-- With ever growing competition in telecommunications markets, operators have to increasingly rely on business intelligence to offer the right incentives to their customer...
Amit Anil Nanavati, Rahul Singh, Dipanjan Chakrabo...
PVLDB
2010
152views more  PVLDB 2010»
15 years 5 months ago
k-Nearest Neighbors in Uncertain Graphs
Complex networks, such as biological, social, and communication networks, often entail uncertainty, and thus, can be modeled as probabilistic graphs. Similar to the problem of sim...
Michalis Potamias, Francesco Bonchi, Aristides Gio...