Sciweavers

776 search results - page 50 / 156
» Network Applications of Graph Bisimulation
Sort
View
IJFCS
1998
67views more  IJFCS 1998»
13 years 9 months ago
Vertex Splitting in Dags and Applications to Partial Scan Designs and Lossy Circuits
Directed acyclic graphs (dags) are often used to model circuits. Path lengths in such dags represent circuit delays. In the vertex splitting problem, the objective is to determine...
Doowon Paik, Sudhakar M. Reddy, Sartaj Sahni
CIKM
2010
Springer
13 years 8 months ago
Fast and accurate estimation of shortest paths in large graphs
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...
SIGSOFT
2008
ACM
14 years 10 months ago
Inter-context control-flow and data-flow test adequacy criteria for nesC applications
NesC is a programming language for applications that run on top of networked sensor nodes. Such an application mainly uses an interrupt to trigger a sequence of operations, known ...
Zhifeng Lai, Shing-Chi Cheung, Wing Kwong Chan
CORR
2008
Springer
173views Education» more  CORR 2008»
13 years 10 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
SEMWEB
2009
Springer
14 years 4 months ago
Analysis of a Real Online Social Network Using Semantic Web Frameworks
Abstract. Social Network Analysis (SNA) provides graph algorithms to characterize the structure of social networks, strategic positions in these networks, specific sub-networks and...
Guillaume Erétéo, Michel Buffa, Fabi...