2239 search results - page 226 / 448 » Computing with abstract matrix structures |
91
Voted
ISVC
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We extend active contours to constrained iterative deconvolution by replacing the external energy function with a model-based likelihood. This enables sub-pixel estimatio...
123
Voted
WG
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
129
Voted
PPAM
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. This paper investigates the complexity of scheduling biprocessor tasks on dedicated processors to minimize mean flow time. Since the general problem is strongly NP-hard,...
99
Voted
MFCS
1993
Springer
15 years 7 months ago
1993
Springer
Abstract This paper offers three candidates for a deterministic, noninterleaving, behaviour model which generalizes Hoare traces to the noninterleaving situation. The three models...
120
Voted
BIRTHDAY
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. This paper gives a reduction-preserving translation from Coquand's dependent pattern matching [4] into a traditional type theory [11] with universes, inductive types...