Sciweavers

1162 search results - page 156 / 233
» Minimum Cycle Bases in Graphs Algorithms and Applications
Sort
View
CORR
2008
Springer
173views Education» more  CORR 2008»
13 years 8 months ago
Decomposition Principles and Online Learning in Cross-Layer Optimization for Delay-Sensitive Applications
In this paper, we propose a general cross-layer optimization framework in which we explicitly consider both the heterogeneous and dynamically changing characteristics of delay-sens...
Fangwen Fu, Mihaela van der Schaar
WWW
2009
ACM
14 years 2 months ago
Building term suggestion relational graphs from collective intelligence
This paper proposes an effective approach to provide relevant search terms for conceptual Web search. ‘Semantic Term Suggestion’ function has been included so that users can f...
Jyh-Ren Shieh, Yung-Huan Hsieh, Yang-Ting Yeh, Tse...
CIKM
2010
Springer
13 years 6 months ago
A hierarchical approach to reachability query answering in very large graph databases
The cost of reachability query computation using traditional algorithms such as depth first search or transitive closure has been found to be prohibitive and unacceptable in mass...
Saikat K. Dey, Hasan M. Jamil
ENTCS
2008
153views more  ENTCS 2008»
13 years 7 months ago
Efficient Conflict Detection in Graph Transformation Systems by Essential Critical Pairs
The well-known notion of critical pairs already allows a static conflict detection, which is important for all kinds of applications and already implemented in AGG. Unfortunately ...
Leen Lambers, Hartmut Ehrig, Fernando Orejas
BMCBI
2006
141views more  BMCBI 2006»
13 years 8 months ago
Maximum common subgraph: some upper bound and lower bound results
Background: Structure matching plays an important part in understanding the functional role of biological structures. Bioinformatics assists in this effort by reformulating this p...
Xiuzhen Huang, Jing Lai, Steven F. Jennings