144 search results - page 15 / 29 » Solving Regular Tree Grammar Based Constraints |
141
click to vote
RAS
2007
15 years 3 months ago
2007
The purpose of this study is to investigate a variational formulation of the problem of three-dimensional (3D) interpretation of temporal image sequences based on the 3D brightnes...
115
click to vote
DAC
2006
ACM
16 years 5 months ago
2006
ACM
Highly regular, nanodevice based architectures have been proposed to replace pure CMOS based architectures in the emerging post CMOS era. Since bottom-up self-assembly is used to ...
155
click to vote
ANOR
2008
15 years 4 months ago
2008
This paper deals with the job-shop scheduling problem with sequencedependent setup times. We propose a new method to solve the makespan minimization problem to optimality. The met...
141
click to vote
COLING
1992
15 years 5 months ago
1992
: This paper describes a possibility of expressing ordering constraints among non-sister constituents in binary branching syntactic structures on a local basis, supported by viewin...
167
click to vote
ICIP
2008
IEEE
16 years 6 months ago
2008
IEEE
In this paper, we present a method for tracking and retexturing of garments that exploits the entire image information using the optical flow constraint instead of working with di...