Sciweavers

201 search results - page 15 / 41
» The Connectivity of addition Cayley graphs
Sort
View
COCOON
2006
Springer
13 years 11 months ago
A Detachment Algorithm for Inferring a Graph from Path Frequency
: Inferring graphs from path frequency has been studied as an important problem which has a potential application to drug design and elucidation of chemical structures. Given a mul...
Hiroshi Nagamochi
ICML
2003
IEEE
14 years 8 months ago
Transductive Learning via Spectral Graph Partitioning
We present a new method for transductive learning, which can be seen as a transductive version of the k nearest-neighbor classifier. Unlike for many other transductive learning me...
Thorsten Joachims
CHI
2009
ACM
14 years 8 months ago
A user study on visualizing directed edges in graphs
Graphs are often visualized using node-link representations: vertices are depicted as dots, edges are depicted as (poly)lines connecting two vertices. A directed edge running from...
Danny Holten, Jarke J. van Wijk
SODA
2007
ACM
127views Algorithms» more  SODA 2007»
13 years 8 months ago
Line-of-sight networks
Random geometric graphs have been one of the fundamental models for reasoning about wireless networks: one places n points at random in a region of the plane (typically a square o...
Alan M. Frieze, Jon M. Kleinberg, R. Ravi, Warren ...
ATAL
2005
Springer
14 years 26 days ago
Discovering strategic multi-agent behavior in a robotic soccer domain
2. THE MASM ALGORITHM An input to the MASM algorithm is a time-annotated multi-agent action sequence. The action sequence is then transformed into an action graph. An action graph ...
Andraz Bezek