Sciweavers

520 search results - page 79 / 104
» New Complexity Results for Classical Planning Benchmarks
Sort
View
JFP
2006
113views more  JFP 2006»
13 years 8 months ago
Efficient manipulation of binary data using pattern matching
Pattern matching is an important operation in functional programs. So far, pattern matching has been investigated in the context of structured terms. This article presents an appr...
Per Gustafsson, Konstantinos F. Sagonas
TOG
2008
106views more  TOG 2008»
13 years 8 months ago
BSGP: bulk-synchronous GPU programming
We present BSGP, a new programming language for general purpose computation on the GPU. A BSGP program looks much the same as a sequential C program. Programmers only need to supp...
Qiming Hou, Kun Zhou, Baining Guo
PAMI
2010
396views more  PAMI 2010»
13 years 6 months ago
Self-Validated Labeling of Markov Random Fields for Image Segmentation
—This paper addresses the problem of self-validated labeling of Markov random fields (MRFs), namely to optimize an MRF with unknown number of labels. We present graduated graph c...
Wei Feng, Jiaya Jia, Zhi-Qiang Liu
FLOPS
2004
Springer
14 years 1 months ago
A Brief Survey of Quantum Programming Languages
Abstract. This article is a brief and subjective survey of quantum programming language research. 1 Quantum Computation Quantum computing is a relatively young subject. It has its ...
Peter Selinger
IEEEPACT
2006
IEEE
14 years 2 months ago
Complexity-based program phase analysis and classification
Modeling and analysis of program behavior are at the foundation of computer system design and optimization. As computer systems become more adaptive, their efficiency increasingly...
Chang-Burm Cho, Tao Li