Sciweavers

2745 search results - page 333 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
HIPC
2005
Springer
15 years 11 months ago
Cooperative Instruction Scheduling with Linear Scan Register Allocation
Abstract. Linear scan register allocation is an attractive register allocation algorithm because of its simplicity and fast running time. However, it is generally felt that linear ...
Khaing Khaing Kyi Win, Weng-Fai Wong
ECOOP
1997
Springer
15 years 10 months ago
Near Optimal Hierarchical Encoding of Types
A type inclusion test is a procedure to decide whether two types are related by a given subtyping relationship. An efficient implementation of the type inclusion test plays an impo...
Andreas Krall, Jan Vitek, R. Nigel Horspool
CVPR
2009
IEEE
17 years 1 months ago
Efficient Scale Space Auto-Context for Image Segmentation and Labeling
The Conditional Random Fields (CRF) model, using patch-based classification bound with context information, has recently been widely adopted for image segmentation/ labeling. In...
Jiayan Jiang (UCLA), Zhuowen Tu (UCLA)
HPCA
2012
IEEE
14 years 1 months ago
Improving write operations in MLC phase change memory
Phase change memory (PCM) recently has emerged as a promising technology to meet the fast growing demand for large capacity memory in modern computer systems. In particular, multi...
Lei Jiang, Bo Zhao, Youtao Zhang, Jun Yang 0002, B...
IROS
2008
IEEE
172views Robotics» more  IROS 2008»
16 years 18 days ago
Motion planning in urban environments: Part II
— We present the motion planning framework for an autonomous vehicle navigating through urban environments. Such environments present a number of motion planning challenges, incl...
Dave Ferguson, Thomas M. Howard, Maxim Likhachev