Sciweavers

587 search results - page 31 / 118
» Improving the Java memory model using CRF
Sort
View
CVPR
2009
IEEE
16 years 9 months ago
Alphabet SOUP: A Framework for Approximate Energy Minimization
Many problems in computer vision can be modeled using conditional Markov random fields (CRF). Since finding the maximum a posteriori (MAP) solution in such models is NP-hard, mu...
Stephen Gould (Stanford University), Fernando Amat...
APLAS
2008
ACM
15 years 3 months ago
Context-Sensitive Relevancy Analysis for Efficient Symbolic Execution
Abstract. Symbolic execution is a flexible and powerful, but computationally expensive technique to detect dynamic behaviors of a program. In this paper, we present a context-sensi...
Xin Li, Daryl Shannon, Indradeep Ghosh, Mizuhito O...
RSS
2007
198views Robotics» more  RSS 2007»
15 years 3 months ago
CRF-Matching: Conditional Random Fields for Feature-Based Scan Matching
— Matching laser range scans observed at different points in time is a crucial component of many robotics tasks, including mobile robot localization and mapping. While existing t...
Fabio T. Ramos, Dieter Fox, Hugh F. Durrant-Whyte
OOPSLA
2005
Springer
15 years 7 months ago
Demand-driven points-to analysis for Java
We present a points-to analysis technique suitable for environments with small time and memory budgets, such as just-in-time (JIT) compilers and interactive development environmen...
Manu Sridharan, Denis Gopan, Lexin Shan, Rastislav...
IPPS
1999
IEEE
15 years 6 months ago
Irregular Parallel Algorithms in JAVA
The nested data-parallel programming model supports the design and implementation of irregular parallel algorithms. This paper describes work in progress to incorporate nested data...
Brian Blount, Siddhartha Chatterjee, Michael Phili...