Sciweavers

1883 search results - page 232 / 377
» Ordered theta graphs
Sort
View
APPROX
2010
Springer
168views Algorithms» more  APPROX 2010»
13 years 11 months ago
Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners
Abstract. Given a directed graph G = (V, E) and an integer k 1, a ktransitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V, EH ) that has (1) the same transitive...
Arnab Bhattacharyya, Elena Grigorescu, Madhav Jha,...
CLA
2007
13 years 11 months ago
An FDP-Algorithm for Drawing Lattices
In this work we want to discuss an algorithm for drawing line diagrams of lattices based on force directed placement (FDP). This widely used technique in graph drawing introduces f...
Christian Zschalig
GECCO
2008
Springer
180views Optimization» more  GECCO 2008»
13 years 10 months ago
Bond-graphs + genetic programming: analysis of an automatically synthesized rotary mechanical system
Initial results of an experiment devised to combine Bond-Graph modeling and simulation with genetic programming for automated design of a simple mechatronic system are reported in...
Saheeb Ahmed Kayani, Muhammad Afzaal Malik
BMCBI
2008
83views more  BMCBI 2008»
13 years 9 months ago
Models of deletion for visualizing bacterial variation: an application to tuberculosis spoligotypes
Background: Molecular typing methods are commonly used to study genetic relationships among bacterial isolates. Many of these methods have become standardized and produce portable...
Josephine F. Reyes, Andrew R. Francis, Mark M. Tan...
RPTEL
2006
75views more  RPTEL 2006»
13 years 9 months ago
A Qualitative Analysis of Collaborative Knowledge Construction through Shared Representations
This paper takes one step towards addressing the question of how activity mediated by shared representations--notations that are manipulated by more than one person during a collab...
Daniel D. Suthers