Sciweavers

353 search results - page 36 / 71
» From graph states to two-graph states
Sort
View
GD
2006
Springer
13 years 11 months ago
Upright-Quad Drawing of st -Planar Learning Spaces
We consider graph drawing algorithms for learning spaces, a type of st-oriented partial cube derived from an antimatroid and used to model states of knowledge of students. We show...
David Eppstein
ICPR
2006
IEEE
14 years 9 months ago
Object Localization Using Input/Output Recursive Neural Networks
Localizing objects in images is a difficult task and represents the first step to the solution of the object recognition problem. This paper presents a novel approach to the local...
Lorenzo Sarti, Marco Maggini, Monica Bianchini
SAC
2009
ACM
14 years 2 months ago
Visualization of clustered directed acyclic graphs with node interleaving
Graph drawing and visualization represent structural information ams of abstract graphs and networks. An important subset of graphs is directed acyclic graphs (DAGs). E-Spring alg...
Pushpa Kumar, Kang Zhang
LOGCOM
1998
178views more  LOGCOM 1998»
13 years 7 months ago
Applying the Mu-Calculus in Planning and Reasoning about Action
Planning algorithms have traditionally been geared toward achievement goals in single-agent environments. Such algorithms essentially produce plans to reach one of a specified se...
Munindar P. Singh
STOC
2010
ACM
170views Algorithms» more  STOC 2010»
14 years 8 days ago
Connectivity oracles for failure prone graphs
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
Ran Duan, Seth Pettie