Sciweavers

1994 search results - page 195 / 399
» Computation of Optical Flow Using Dynamic Programming
Sort
View
ESOP
2000
Springer
15 years 1 months ago
Alias Types
Abstract. Linear type systems allow destructive operations such as object deallocation and imperative updates of functional data structures. These operations and others, such as th...
Frederick Smith, David Walker, J. Gregory Morriset...
84
Voted
PLDI
2010
ACM
15 years 3 months ago
Supporting speculative parallelization in the presence of dynamic data structures
The availability of multicore processors has led to significant interest in compiler techniques for speculative parallelization of sequential programs. Isolation of speculative s...
Chen Tian, Min Feng, Rajiv Gupta
84
Voted
MICRO
2009
IEEE
137views Hardware» more  MICRO 2009»
15 years 4 months ago
ESKIMO: Energy savings using Semantic Knowledge of Inconsequential Memory Occupancy for DRAM subsystem
Dynamic Random Access Memory (DRAM) is used as the bulk of the main memory in most computing systems and its energy and power consumption has become a first-class design considera...
Ciji Isen, Lizy Kurian John
79
Voted
PPDP
1999
Springer
15 years 2 months ago
Distributed Programming in a Multi-Paradigm Declarative Language
Curry is a multi-paradigm declarative language covering functional, logic, and concurrent programming paradigms. Curry’s operational semantics is based on lazy reduction of expre...
Michael Hanus
105
Voted
CORR
2010
Springer
200views Education» more  CORR 2010»
14 years 10 months ago
Unified Compression-Based Acceleration of Edit-Distance Computation
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic programming s...
Danny Hermelin, Gad M. Landau, Shir Landau, Oren W...