4926 search results - page 504 / 986 » Two Graph Algorithms On an Associative Computing Model |
128
Voted
COCO
2003
Springer
15 years 9 months ago
2003
Springer
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
145
Voted
SWAT
2000
Springer
15 years 7 months ago
2000
Springer
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...
146
Voted
IWPEC
2009
Springer
15 years 10 months ago
2009
Springer
In this paper we initiate a systematic study of the Reduced Degree Spanning Tree problem, where given a digraph D and a nonnegative integer k, the goal is to construct a spanning o...
128
click to vote
SCALESPACE
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. We propose a variational model which permits to simultaneously deblur and oversample an image. Indeed, after some recalls on an existing variational model for image overs...
177
Voted
ASPLOS
2011
ACM
14 years 7 months ago
2011
ACM
Graphics processing units (GPUs) provide a low cost platform for accelerating high performance computations. The introduction of new programming languages, such as CUDA and OpenCL...