603 search results - page 60 / 121 » A General Approximation Technique for Constrained Forest Pro... |
114
click to vote
EUROPAR
2005
Springer
15 years 5 months ago
2005
Springer
The model of moldable task (MT) was introduced some years ago and has been proved to be an efficient way for implementing parallel applications. It considers a target application ...
181
click to vote
ICDE
2008
IEEE
16 years 1 months ago
2008
IEEE
Despite the surge of interest in data reduction techniques over the past years, no method has been proposed to date that can always achieve approximation quality preferable to that...
118
click to vote
SIGGRAPH
1992
ACM
15 years 3 months ago
1992
ACM
This paper discusses how interval analysis can be used to solve a wide variety of problems in computer graphics. These problems include ray tracing, interference detection, polygo...
101
click to vote
PATAT
1995
Springer
15 years 3 months ago
1995
Springer
The scheduling of exams in institutions of higher education is known to be a highly constrained problem. The advent of modularity in many institutions in the UK has resulted in a s...
CPM
2004
Springer
15 years 5 months ago
2004
Springer
Given a set S = {s1, s2, . . . , sn} of strings each of length m, and an integer L, we study the following two problems. k-Closest Substring problem: find k center strings c1, c2,...