Sciweavers

353 search results - page 21 / 71
» From graph states to two-graph states
Sort
View
ICCS
2009
Springer
14 years 2 months ago
Semantic Search - Using Graph-Structured Semantic Models for Supporting the Search Process
Semantic search attempts to go beyond the current state of the art in information access by addressing information needs on the semantic level, i.e. considering the meaning of user...
Thanh Tran, Peter Haase, Rudi Studer
CCGRID
2006
IEEE
14 years 2 months ago
Nexus: A Novel Weighted-Graph-Based Prefetching Algorithm for Metadata Servers in Petabyte-Scale Storage Systems
Abstract— An efficient, accurate and distributed metadataoriented prefetching scheme is critical to the overall performance in large distributed storage systems. In this paper, ...
Peng Gu, Yifeng Zhu, Hong Jiang, Jun Wang
SYNASC
2006
IEEE
103views Algorithms» more  SYNASC 2006»
14 years 1 months ago
Incremental Deterministic Planning
We present a new planning algorithm that formulates the planning problem as a counting satisfiability problem in which the number of available solutions guides the planner determ...
Stefan Andrei, Wei-Ngan Chin, Martin C. Rinard
TAGT
1998
Springer
243views Graph Theory» more  TAGT 1998»
14 years 3 days ago
Double-Pullback Graph Transitions: A Rule-Based Framework with Incomplete Information
Reactive systems perform their tasks through interaction with their users or with other systems (as parts of a bigger system). An essential requirement for modeling such systems is...
Hartmut Ehrig, Reiko Heckel, Mercè Llabr&ea...
JGT
2007
68views more  JGT 2007»
13 years 7 months ago
Forcing highly connected subgraphs
A well-known theorem of Mader [5] states that highly connected subgraphs can be forced in finite graphs by assuming a high minimum degree. Solving a problem of Diestel [2], we ex...
Maya Jakobine Stein