Sciweavers

144 search results - page 15 / 29
» Solving Regular Tree Grammar Based Constraints
Sort
View
RAS
2007
115views more  RAS 2007»
14 years 11 months ago
A variational method for the recovery of dense 3D structure from motion
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...
Hicham Sekkati, Amar Mitiche
DAC
2006
ACM
16 years 20 days ago
Topology aware mapping of logic functions onto nanowire-based crossbar architectures
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 ...
Wenjing Rao, Alex Orailoglu, Ramesh Karri
ANOR
2008
171views more  ANOR 2008»
14 years 11 months ago
A branch and bound method for the job-shop problem with sequence-dependent setup times
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...
Christian Artigues, Dominique Feillet
COLING
1992
15 years 26 days ago
The Proper Treatment Of Word Order In HPSG
: 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...
Karel Oliva
ICIP
2008
IEEE
16 years 1 months ago
Optical flow based tracking and retexturing of garments
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...
Anna Hilsmann, Peter Eisert