Sciweavers

303 search results - page 3 / 61
» Context-Sensitive Call Control Using Constraints and Rules
Sort
View
CC
2007
Springer
14 years 1 months ago
Correcting the Dynamic Call Graph Using Control-Flow Constraints
Abstract. To reason about programs, dynamic optimizers and analysis tools use sampling to collect a dynamic call graph (DCG). However, sampling has not achieved high accuracy with ...
Byeongcheol Lee, Kevin Resnick, Michael D. Bond, K...
ICCV
2005
IEEE
14 years 9 months ago
Bottom-up/Top-Down Image Parsing by Attribute Graph Grammar
In this paper, we present an attribute graph grammar for image parsing on scenes with man-made objects, such as buildings, hallways, kitchens, and living rooms. We choose one clas...
Feng Han, Song Chun Zhu
OOPSLA
2007
Springer
14 years 1 months ago
Probabilistic calling context
Calling context enhances program understanding and dynamic analyses by providing a rich representation of program location. Compared to imperative programs, objectoriented program...
Michael D. Bond, Kathryn S. McKinley
SGP
2003
13 years 9 months ago
Stellar Subdivision Grammars
In this paper we develop a new description for subdivision surfaces based on a graph grammar formalism. Subdivision schemes are specified by a context sensitive grammar in which ...
Luiz Velho
JMLR
2010
134views more  JMLR 2010»
13 years 2 months ago
Using Contextual Representations to Efficiently Learn Context-Free Languages
We present a polynomial update time algorithm for the inductive inference of a large class of context-free languages using the paradigm of positive data and a membership oracle. W...
Alexander Clark, Rémi Eyraud, Amaury Habrar...