Sciweavers

3396 search results - page 454 / 680
» Tree representations of graphs
Sort
View
CVPR
2005
IEEE
16 years 8 months ago
Particle Filtering for Geometric Active Contours with Application to Tracking Moving and Deforming Objects
Geometric active contours are formulated in a manner which is parametrization independent. As such, they are amenable to representation as the zero level set of the graph of a hig...
Yogesh Rathi, Namrata Vaswani, Allen Tannenbaum, A...
ICSE
2004
IEEE-ACM
16 years 6 months 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
TNN
1998
123views more  TNN 1998»
15 years 6 months ago
A general framework for adaptive processing of data structures
—A structured organization of information is typically required by symbolic processing. On the other hand, most connectionist models assume that data are organized according to r...
Paolo Frasconi, Marco Gori, Alessandro Sperduti
SIGSOFT
2006
ACM
16 years 7 months ago
User guidance for creating precise and accessible property specifications
Property specifications concisely describe aspects of what a system is supposed to do. No matter what notation is used to describe them, however, it is difficult to represent thes...
Rachel L. Cobleigh, George S. Avrunin, Lori A. Cla...
ECSA
2007
Springer
16 years 24 days ago
Architecture Migration Driven by Code Categorization
Abstract. In this paper, we report on the development of a methodology for the evolution of software towards new architectures. In our approach, we represent source code as graphs....
Rui Correia, Carlos M. P. Matos, Reiko Heckel, Moh...