Sciweavers

1605 search results - page 108 / 321
» On Partitional Labelings of Graphs
Sort
View
147
Voted
PPSWR
2005
Springer
15 years 9 months ago
Computational Treatment of Temporal Notions: The CTTN-System
The CTTN-system is a computer program which provides advanced processing or temporal notions. The basic data structures of the CTTN-system are time points, crisp and fuzzy time int...
Hans Jürgen Ohlbach
ICML
2007
IEEE
16 years 4 months ago
The rendezvous algorithm: multiclass semi-supervised learning with Markov random walks
We consider the problem of multiclass classification where both labeled and unlabeled data points are given. We introduce and demonstrate a new approach for estimating a distribut...
Arik Azran
120
Voted
GD
2005
Springer
15 years 9 months ago
Visualizing Graphs as Trees: Plant a Seed and Watch it Grow
TreePlus is a graph browsing technique based on a tree-style layout. It shows the missing graph structure using interaction techniques and enables users to start with a specific no...
Bongshin Lee, Cynthia Sims Parr, Catherine Plaisan...
126
Voted
SIGMOD
2004
ACM
121views Database» more  SIGMOD 2004»
16 years 3 months ago
An Optimal Algorithm for Querying Tree Structures and its Applications in Bioinformatics
Trees and graphs are widely used to model biological databases. Providing efficient algorithms to support tree-based or graph-based querying is therefore an important issue. In th...
Hsiao-Fei Liu, Ya-Hui Chang, Kun-Mao Chao
159
Voted
PE
2011
Springer
167views Optimization» more  PE 2011»
14 years 10 months ago
Passage-time computation and aggregation strategies for large semi-Markov processes
High-level semi-Markov modelling paradigms such as semi-Markov stochastic Petri nets and process algebras are used to capture realistic performance models of computer and communic...
Marcel C. Guenther, Nicholas J. Dingle, Jeremy T. ...