Sciweavers

4757 search results - page 525 / 952
» Monads for Functional Programming
Sort
View
CORR
2011
Springer
188views Education» more  CORR 2011»
15 years 1 months ago
Information-Theoretic Viewpoints on Optimal Causal Coding-Decoding Problems
—In this paper we consider an interacting two-agent sequential decision-making problem consisting of a Markov source process, a causal encoder with feedback, and a causal decoder...
Siva K. Gorantla, Todd P. Coleman
ICIP
2006
IEEE
16 years 8 months ago
Efficient Object-Based Video Inpainting
Video inpainting is the process of repairing missing regions (holes) in videos. Most automatic techniques are computationally intensive and unable to repair large holes. To tackle...
Sen-Ching S. Cheung, Jian Zhao, M. Vijay Venkatesh
DAC
1999
ACM
16 years 7 months ago
Graph Coloring Algorithms for Fast Evaluation of Curtis Decompositions
Finding the minimum column multiplicity for a bound set of variables is an important problem in Curtis decomposition. To investigate this problem, we compared two graphcoloring pr...
Marek A. Perkowski, Rahul Malvi, Stan Grygiel, Mic...
ASPLOS
2009
ACM
16 years 7 months ago
GPU acceleration of a production molecular docking code
Abstract: Modeling the interactions of biological molecules, or docking, is critical to both understanding basic life processes and to designing new drugs. Here we describe the GPU...
Bharat Sukhwani, Martin C. Herbordt
CVPR
2010
IEEE
16 years 2 months ago
Convex Shape Decomposition
In this paper, we propose a new shape decomposition method, called convex shape decomposition. We formalize the convex decomposition problem as an integer linear programming probl...
Liu Hairong, Longin Jan Latecki, Liu Wenyu