Sciweavers

1801 search results - page 9 / 361
» Pointing without a pointer
Sort
View
SAS
2004
Springer
103views Formal Methods» more  SAS 2004»
14 years 1 months ago
A Scalable Nonuniform Pointer Analysis for Embedded Programs
Abstract. In this paper we present a scalable pointer analysis for embedded applications that is able to distinguish between instances of recursively defined data structures and e...
Arnaud Venet
MICRO
1995
IEEE
108views Hardware» more  MICRO 1995»
13 years 11 months ago
SPAID: software prefetching in pointer- and call-intensive environments
Software prefetching, typically in the context of numericor loop-intensive benchmarks, has been proposed as one remedy for the performance bottleneck imposed on computer systems b...
Mikko H. Lipasti, William J. Schmidt, Steven R. Ku...
ISSE
2010
13 years 6 months ago
Software model checking without source code
We present a framework, called AIR, for verifying safety properties of assembly language proa software model checking. AIR extends the applicability of predicate abstraction and x...
Sagar Chaki, James Ivers
EMMCVPR
2009
Springer
13 years 5 months ago
Intrinsic Second-Order Geometric Optimization for Robust Point Set Registration without Correspondence
Determining Euclidean transformations for the robust registration of noisy unstructured point sets is a key problem of model-based computer vision and numerous industrial applicati...
Dirk Breitenreicher, Christoph Schnörr
MVA
2008
305views Computer Vision» more  MVA 2008»
13 years 7 months ago
A new graph cut-based multiple active contour algorithm without initial contours and seed points
This paper presents a new graph cut-based multiple active contour algorithm to detect optimal boundaries and regions in images without initial contours and seed points. The task of...
Jong-Sung Kim, Ki-Sang Hong