1702 search results - page 103 / 341 » Doomed program points |
147
click to vote
GRAPHICSINTERFACE
2004
15 years 6 months ago
2004
We present a novel algorithm for accurate, high quality point rendering, which is based on the formulation of splatting using homogeneous coordinates. In contrast to previous meth...
141
Voted
COLING
1994
15 years 6 months ago
1994
We present a new apl)roach , ilhlstrated by two algorithms> for parsing not only Finite SI.ate (:Iranlnlars but also Context Free Grainlnars and their extension, by means of fi...
172
click to vote
HEURISTICS
1998
15 years 4 months ago
1998
We consider the maximum covering problem, a combinatorial optimization problem that arises in many facility location problems. In this problem, a potential facility site covers a s...
143
click to vote
OL
2010
15 years 3 months ago
2010
We consider the convex optimization problem minx{f(x) : gj(x) ≤ 0, j = 1, . . . , m} where f is convex, the feasible set K is convex and Slater’s condition holds, but the funct...
139
click to vote
CONCUR
2009
Springer
15 years 11 months ago
2009
Springer
Several programming constructs have recently been proposed with the purpose of enabling the programmer to encode declassifying information flows within a program that complies wi...