Sciweavers

1477 search results - page 41 / 296
» On Graph Problems in a Semi-streaming Model
Sort
View
DAM
2010
104views more  DAM 2010»
14 years 8 months ago
Sorting with networks of data structures
We consider the problem of sorting a permutation using a network of data structures as introduced by Knuth and Tarjan. In general the model as considered previously was restricted...
Therese C. Biedl, Alexander Golynski, Angèl...
WABI
2007
Springer
15 years 3 months ago
A Graph Clustering Approach to Weak Motif Recognition
The aim of the motif recognition problem is to detect a set of mutually similar subsequences within a collection of biological sequences. The weak motif recognition problem on DNA ...
Christina Boucher, Daniel G. Brown, Paul Church
JCO
2007
113views more  JCO 2007»
14 years 9 months ago
Recent progress in mathematics and engineering on optimal graph labellings with distance conditions
The problem of radio channel assignments with multiple levels of interference can be modelled using graph theory. The theory of integer vertex-labellings of graphs with distance c...
Jerrold R. Griggs, Xiaohua Teresa Jin
SODA
2001
ACM
79views Algorithms» more  SODA 2001»
14 years 11 months ago
Learning Markov networks: maximum bounded tree-width graphs
Markov networks are a common class of graphical models used in machine learning. Such models use an undirected graph to capture dependency information among random variables in a ...
David R. Karger, Nathan Srebro
EDBT
2009
ACM
118views Database» more  EDBT 2009»
15 years 4 months ago
Flexible query answering on graph-modeled data
The largeness and the heterogeneity of most graph-modeled datasets in several database application areas make the query process a real challenge because of the lack of a complete ...
Federica Mandreoli, Riccardo Martoglia, Giorgio Vi...