3663 search results - page 365 / 733 » Problems in the ontology of computer programs |
189
click to vote
CVPR
2006
IEEE
16 years 8 months ago
2006
IEEE
Resolving local ambiguities is an important issue for shape from shading (SFS). Pixel ambiguities of SFS can be eliminated by propagation approaches. However, patch ambiguities st...
154
click to vote
ICALP
2005
Springer
16 years 10 days ago
2005
Springer
Abstract. In this paper we present a randomized constant factor approximation algorithm for the problem of computing the optimal cost of the metric Minimum Facility Location proble...
171
click to vote
CCCG
1994
15 years 8 months ago
1994
We formulate the problem of computing the widest empty corridor with at most ` links and right-angle turns for a set of n points. It is a generalization of the widest empty corrid...
186
click to vote
ICFP
2002
ACM
16 years 6 months ago
2002
ACM
Monads are a useful abstraction of computation, as they model diverse computational effects such as stateful computations, exceptions and I/O in a uniform manner. Their potential ...
165
click to vote
CONCUR
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We present a new method for proving liveness and termination properties for fair concurrent programs, which does not rely on finding a ranking function or on computing th...