Sciweavers

837 search results - page 74 / 168
» Hard combinators
Sort
View
CP
2006
Springer
15 years 3 months ago
Towards an Efficient SAT Encoding for Temporal Reasoning
Abstract. In this paper, we investigate how an IA network can be effectively encoded into the SAT domain. We propose two basic approaches to modelling an IA network as a CSP: one r...
Duc Nghia Pham, John Thornton, Abdul Sattar
DAGM
2006
Springer
15 years 3 months ago
Segmentation-Based Motion with Occlusions Using Graph-Cut Optimization
Abstract. We propose to tackle the optical flow problem by a combination of two recent advances in the computation of dense correspondences, namely the incorporation of image segme...
Michael Bleyer, Christoph Rhemann, Margrit Gelautz
FPGA
2006
ACM
139views FPGA» more  FPGA 2006»
15 years 3 months ago
Fast and accurate resource estimation of automatically generated custom DFT IP cores
This paper presents an equation-based resource utilization model for automatically generated discrete Fourier transform (DFT) soft core IPs. The parameterized DFT IP generator all...
Peter A. Milder, Mohammad Ahmad, James C. Hoe, Mar...
GECCO
2000
Springer
250views Optimization» more  GECCO 2000»
15 years 3 months ago
A Simple and Fast GA-SA hybrid Image Segmentation Algorithm
Image segmentation is an important process of image analysis. Most of the published approaches for image segmentation need to set appropriate parameter values to cope with the unc...
Shinn-Ying Ho, Kual-Zheng Lee
HUMO
2000
Springer
15 years 3 months ago
Hand Shape Estimation Using Image Transition Network
This paper presents a method of hand posture estimation from silhouette images taken by two cameras. First, we extract the silhouette contour for a pair of images. We construct an...
Yasushi Hamada, Nobutaka Shimada, Yoshiaki Shirai