Sciweavers

359 search results - page 62 / 72
» Solving Geometric Covering Problems by Data Reduction
Sort
View
CVPR
2003
IEEE
14 years 1 months ago
Dynamic Depth Recovery from Unsynchronized Video Streams
In this paper, we propose an algorithm for estimating dense depth information of dynamic scenes from multiple video streams captured using unsynchronized stationary cameras. We so...
Chunxiao Zhou, Hai Tao
JEI
2007
176views more  JEI 2007»
13 years 7 months ago
Adaptive techniques for microarray image analysis with related quality assessment
We propose novel techniques for microarray image analysis. In particular, we describe an overall pipeline able to solve the most common problems of microarray image analysis. We pr...
Sebastiano Battiato, Gianpiero di Blasi, Giovanni ...
CORR
2011
Springer
175views Education» more  CORR 2011»
13 years 2 months ago
A Novel Probabilistic Pruning Approach to Speed Up Similarity Queries in Uncertain Databases
Abstract— In this paper, we propose a novel, effective and efficient probabilistic pruning criterion for probabilistic similarity queries on uncertain data. Our approach support...
Thomas Bernecker, Tobias Emrich, Hans-Peter Kriege...
SMC
2007
IEEE
156views Control Systems» more  SMC 2007»
14 years 2 months ago
Dynamic fusion of classifiers for fault diagnosis
—This paper considers the problem of temporally fusing classifier outputs to improve the overall diagnostic classification accuracy in safety-critical systems. Here, we discuss d...
Satnam Singh, Kihoon Choi, Anuradha Kodali, Krishn...
ISPD
2000
ACM
113views Hardware» more  ISPD 2000»
14 years 2 days ago
Floorplan area minimization using Lagrangian relaxation
modules can be handled in constraint graphs efficiently. This Floorplan area minimization is an important problem because many modules have shape flexibilities during the floorplan...
Fung Yu Young, Chris C. N. Chu, W. S. Luk, Y. C. W...