Sciweavers

17760 search results - page 3478 / 3552
» A Generalization of the Massey-Ding Algorithm
Sort
View
ISAAC
2010
Springer
277views Algorithms» more  ISAAC 2010»
14 years 11 months ago
Induced Subgraph Isomorphism on Interval and Proper Interval Graphs
The Induced Subgraph Isomorphism problem on two input graphs G and H is to decide whether G has an induced subgraph isomorphic to H. Already for the restricted case where H is a c...
Pinar Heggernes, Daniel Meister, Yngve Villanger
ISVC
2010
Springer
14 years 11 months ago
Indented Pixel Tree Plots
We introduce Indented Pixel Tree Plots (IPTPs): a novel pixel-based visualization technique for depicting large hierarchies. It is inspired by the visual metaphor of indented outli...
Michael Burch, Michael Raschke, Daniel Weiskopf
AMAI
1999
Springer
15 years 1 months ago
STCSP - Structured Temporal Constraint satisfaction Problems
Temporal Constraint Satisfaction Problems (TCSP) is a well known approach for representing and processing temporal knowledge. Important properties of the knowledge can be inferred...
Mira Balaban, Tzachi Rosen
GIS
2010
ACM
15 years 57 min ago
Ontuition: intuitive data exploration via ontology navigation
We present Ontuition, a system for mapping ontologies. Transforming data to a usable format for Ontuition involves recognizing and resolving data values corresponding to concepts ...
Marco D. Adelfio, Michael D. Lieberman, Hanan Same...
ALGORITHMICA
1999
99views more  ALGORITHMICA 1999»
15 years 1 months ago
Evolutionary Trees and Ordinal Assertions
Sequence data for a group of species is often summarized by a distance matrix M where M[s, t] is the dissimilarity between the sequences of species s and t. An ordinal assertion is...
Paul E. Kearney, Ryan Hayward, Henk Meijer
« Prev « First page 3478 / 3552 Last » Next »