Sciweavers

1184 search results - page 151 / 237
» Memory Design for Constrained Dynamic Optimization Problems
Sort
View
POPL
2003
ACM
16 years 2 months ago
New results on the computability and complexity of points - to analysis
Given a program and two variables p and q, the goal of points-to analysis is to check if p can point to q in some execution of the program. This well-studied problem plays a cruci...
Venkatesan T. Chakaravarthy
124
Voted
LCTRTS
2007
Springer
15 years 8 months ago
Scratchpad allocation for data aggregates in superperfect graphs
Existing methods place data or code in scratchpad memory, i.e., SPM by either relying on heuristics or resorting to integer programming or mapping it to a graph coloring problem. ...
Lian Li 0002, Quan Hoang Nguyen, Jingling Xue
PLDI
2004
ACM
15 years 8 months ago
Vectorization for SIMD architectures with alignment constraints
When vectorizing for SIMD architectures that are commonly employed by today’s multimedia extensions, one of the new challenges that arise is the handling of memory alignment. Pr...
Alexandre E. Eichenberger, Peng Wu, Kevin O'Brien
ICPR
2004
IEEE
16 years 3 months ago
3D Face Pose Tracking From an Uncalibrated Monocular Camera
ct We propose a new near-real time technique for 3D face pose tracking from a monocular image sequence obtained from an uncalibrated camera. The basic idea behind our approach is t...
Qiang Ji, Zhiwei Zhu
ICCAD
1997
IEEE
137views Hardware» more  ICCAD 1997»
15 years 6 months ago
Optimization techniques for high-performance digital circuits
The relentless push for high performance in custom digital circuits has led to renewed emphasis on circuit optimization or tuning. The parameters of the optimization are typically...
Chandramouli Visweswariah