Sciweavers

1206 search results - page 100 / 242
» Arc-Flags in Dynamic Graphs
Sort
View
ICSE
2004
IEEE-ACM
16 years 26 days ago
Using Compressed Bytecode Traces for Slicing Java Programs
Dynamic slicing is a well-known program debugging technique. Given a program P and input I, it finds all program statements which directly/indirectly affect the values of some var...
Tao Wang, Abhik Roychoudhury
MMS
2007
15 years 9 days ago
Modeling user context with applications to media retrieval
In this paper, we develop a theoretical understanding of multi-sensory knowledge and user context and their interrelationships. This is used to develop a generic representation fr...
Ankur Mani, Hari Sundaram
ISCI
2007
96views more  ISCI 2007»
15 years 21 days ago
A new algorithm for removing node overlapping in graph visualization
Techniques for drawing graphs have proven successful in producing good layouts of undirected graphs. When nodes must be labeled however, the problem of overlapping nodes arises, p...
Xiaodi Huang, Wei Lai, A. S. M. Sajeev, Junbin Gao
105
Voted
ICPR
2010
IEEE
15 years 2 months ago
Lipreading: A Graph Embedding Approach
In this paper, we propose a novel graph embedding method for the problem of lipreading. To characterize the temporal connections among video frames of the same utterance, a new di...
Ziheng Zhou, Guoying Zhao, Matti Pietikäinen
112
Voted
FMOODS
2006
15 years 2 months ago
Defining Object-Oriented Execution Semantics Using Graph Transformations
In this paper we describe an application of the theory of graph transformations to the practise of language design. In particular, we have defined the static and dynamic semantics ...
Harmen Kastenberg, Anneke Kleppe, Arend Rensink