5128 search results - page 342 / 1026 » When Abstraction Fails |
169
click to vote
IBPRIA
2003
Springer
16 years 23 days ago
2003
Springer
Abstract. This paper deals with the problem of reconstructing a highresolution image from an incomplete set of undersampled, blurred and noisy images shifted with subpixel displace...
187
click to vote
ISAAC
2003
Springer
16 years 22 days ago
2003
Springer
Abstract. We give linear-time algorithms for re-ordering and heightrestricting a binary search tree with only a small increase in cost, constructing a nearly optimal binary search ...
190
click to vote
ICRA
2002
IEEE
16 years 14 days ago
2002
IEEE
Abstract— We present an incremental algorithm to estimate the penetration depth between convex polytopes in 3D. The algorithm incrementally seeks a “locally optimal solution”...
185
click to vote
GECCO
2010
Springer
16 years 10 days ago
2010
Springer
Abstract. We discuss the problem of model selection in Genetic Programming using the framework provided by Statistical Learning Theory, i.e. Vapnik-Chervonenkis theory (VC). We pre...
188
click to vote
ICALP
2010
Springer
16 years 10 days ago
2010
Springer
Abstract. We prove a new congruence result for the π-calculus: bisimilarity is a congruence in the sub-calculus that does not include restriction nor sum, and features top-level r...