Sciweavers

690 search results - page 92 / 138
» Dense Admissible Sets
Sort
View
EMMCVPR
2009
Springer
15 years 10 months ago
Reconstructing Optical Flow Fields by Motion Inpainting
An edge-sensitive variational approach for the restoration of optical flow fields is presented. Real world optical flow fields are frequently corrupted by noise, reflection artifac...
Benjamin Berkels, Claudia Kondermann, Christoph S....
FSTTCS
2006
Springer
15 years 10 months ago
Multi-stack Boundary Labeling Problems
The boundary labeling problem was recently introduced in [5] as a response to the problem of labeling dense point sets with large labels. In boundary labeling, we are given a recta...
Michael A. Bekos, Michael Kaufmann, Katerina Potik...
ICCV
1995
IEEE
15 years 9 months ago
Algorithms for Implicit Deformable Models
This paper presents a framework for implicit deformable models and a pair of new algorithms for solving the nonlinear partial di erential equations that result from this framework...
Ross T. Whitaker
AUTONOMICS
2007
ACM
15 years 8 months ago
Multi-hop broadcast from theory to reality: practical design for ad hoc networks
We propose a complete design for a scope limited, multihop broadcast middleware, which is adapted to the variability of the ad-hoc environment and works in unlimited ad-hoc networ...
Alaeddine El Fawal, Jean-Yves Le Boudec, Kav&eacut...
JCT
2007
96views more  JCT 2007»
15 years 6 months ago
Co-degree density of hypergraphs
For an r-graph H, let C(H) = minS d(S), where the minimum is taken over all (r − 1)-sets of vertices of H, and d(S) is the number of vertices v such that S ∪ {v} is an edge of...
Dhruv Mubayi, Yi Zhao