Sciweavers

1265 search results - page 119 / 253
» Algorithms for Drawing Media
Sort
View
WWW
2005
ACM
15 years 9 months ago
Preferential walk: towards efficient and scalable search in unstructured peer-to-peer networks
To improve search efficiency and reduce unnecessary traffic in Peerto-Peer (P2P) networks, this paper proposes a trust-based probabilistic search algorithm, called preferential wa...
Hai Zhuge, Xue Chen, Xiaoping Sun
GD
2004
Springer
15 years 9 months ago
Visual Navigation of Compound Graphs
This paper describes a local update scheme for the algorithm of Sugiyama and Misue (IEEE Trans. on Systems, Man, and Cybernetics 21 (1991) 876–892) for drawing views of compound ...
Marcus Raitner
ESA
2008
Springer
130views Algorithms» more  ESA 2008»
15 years 5 months ago
Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs
Abstract. A level graph is a directed acyclic graph with a level assignment for each node. Such graphs play a prominent role in graph drawing. They express strict dependencies and ...
Christian Bachmaier, Wolfgang Brunner
AAAI
2006
15 years 5 months ago
Extending Dynamic Backtracking to Solve Weighted Conditional CSPs
Many planning and design problems can be characterized as optimal search over a constrained network of conditional choices with preferences. To draw upon the advanced methods of c...
Robert T. Effinger, Brian C. Williams
CHI
2001
ACM
16 years 4 months ago
ConNexus to awarenex: extending awareness to mobile users
We explored the use of awareness information to facilitate communication by developing a series of prototypes. The ConNexus prototype integrates awareness information, instant mes...
John C. Tang, Nicole Yankelovich, James Begole, Ma...