Sciweavers

140 search results - page 23 / 28
» Orderings and Constraints: Theory and Practice of Proving Te...
Sort
View
101
Voted
PAMI
2007
176views more  PAMI 2007»
14 years 11 months ago
Approximate Labeling via Graph Cuts Based on Linear Programming
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
Nikos Komodakis, Georgios Tziritas
JDCTA
2010
172views more  JDCTA 2010»
14 years 6 months ago
A Method of Bearing Fault Feature Extraction Based on Improved Wavelet Packet and Hilbert Analysis
In order to supply a gap of current resonance vibration and STFT demodulation method applied to rolling bearing fault feature extraction of city rail vehicle, a fault diagnosis me...
Jian-wei Yang, De-chen Yao, Guo-qiang Cai, Hai-bo ...
IJCV
2002
240views more  IJCV 2002»
14 years 11 months ago
Self-Calibration of Rotating and Zooming Cameras
In this paper we describe the theory and practice of self-calibration of cameras which are fixed in location and may freely rotate while changing their internal parameters by zoomi...
Lourdes de Agapito, Eric Hayman, Ian D. Reid
DATE
2006
IEEE
87views Hardware» more  DATE 2006»
15 years 5 months ago
Supporting task migration in multi-processor systems-on-chip: a feasibility study
With the advent of multi-processor systems-on-chip, the interest in process migration is again on the rise both in research and in product development. New challenges associated w...
Stefano Bertozzi, Andrea Acquaviva, Davide Bertozz...
CP
2003
Springer
15 years 4 months ago
Using the Breakout Algorithm to Identify Hard and Unsolvable Subproblems
Abstract. Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to de...
Carlos Eisenberg, Boi Faltings