Sciweavers

4302 search results - page 338 / 861
» Index Pairs Algorithms
Sort
View
APPROX
2009
Springer
195views Algorithms» more  APPROX 2009»
15 years 11 months ago
Approximating Node-Connectivity Augmentation Problems
The (undirected) Node Connectivity Augmentation (NCA) problem is: given a graph J = (V, EJ ) and connectivity requirements {r(u, v) : u, v ∈ V }, find a minimum size set I of n...
Zeev Nutov
ICIP
2003
IEEE
16 years 6 months ago
Towards an efficient high quality picture-rate up-converter
Motion estimation algorithms play a key role in picture-rate up-conversion. To realise high quality interpolated images, while keeping the processing requirements low, we analyse ...
Aleksandar Beric, Gerard de Haan, Jef L. van Meerb...
TACAS
2009
Springer
134views Algorithms» more  TACAS 2009»
15 years 11 months ago
Computing Weakest Strategies for Safety Games of Imperfect Information
CEDAR (Counter Example Driven Antichain Refinement) is a new symbolic algorithm for computing weakest strategies for safety games of imperfect information. The algorithm computes ...
Wouter Kuijper, Jaco van de Pol
FIRA
2009
Springer
116views Robotics» more  FIRA 2009»
15 years 11 months ago
A Study on Stereo and Motion Data Accuracy for a Moving Platform
Abstract. Stereo and motion analysis are potential techniques for providing information for control or assistance systems in various robotics or driver assistance applications. Thi...
Sandino Morales, Young Woon Woo, Reinhard Klette, ...
140
Voted
IDA
2009
Springer
15 years 11 months ago
Probabilistic Factorization of Non-negative Data with Entropic Co-occurrence Constraints
Abstract. In this paper we present a probabilistic algorithm which factorizes non-negative data. We employ entropic priors to additionally satisfy that user specified pairs of fac...
Paris Smaragdis, Madhusudana V. S. Shashanka, Bhik...