3874 search results - page 437 / 775 » Approximation Algorithms for k-hurdle Problems |
204
click to vote
ICPR
2004
IEEE
16 years 7 months ago
2004
IEEE
In this paper novel theory to automate shape modelling is described. The main idea is to develop a theory that is intrinsically defined for curves, as opposed to a finite sample o...
154
click to vote
ATAL
2003
Springer
15 years 12 months ago
2003
Springer
In complex distributed applications, a problem is often decomposed into a set of subproblems that are distributed to multiple agents. We formulate this class of problems with a tw...
171
click to vote
COCOON
1999
Springer
15 years 11 months ago
1999
Springer
Scheduling jobs with pairwise conflicts is modeled by the graph multicoloring problem. It occurs in two versions: in the preemptive case, each vertex may get any set of colors, w...
192
click to vote
MOC
2000
15 years 6 months ago
2000
The aim of this paper is to display numerical results that show the interest of some multilevel methods for problems of parabolic type. These schemes are based on multilevel spatia...
158
click to vote
ICDT
2010
ACM
15 years 10 months ago
2010
ACM
Given a database instance and a corresponding view instance, we address the view definitions problem (VDP): Find the most succinct and accurate view definition, when the view quer...