Sciweavers

12289 search results - page 636 / 2458
» computing 2006
Sort
View
DISOPT
2007
93views more  DISOPT 2007»
15 years 7 months ago
A polynomial time equivalence between DNA sequencing and the exact perfect matching problem
We investigate the computational complexity of a combinatorial problem that arises in DNA sequencing by hybridization: The input consists of an integer together with a set S of wo...
Jacek Blazewicz, Piotr Formanowicz, Marta Kasprzak...
GD
2006
Springer
15 years 10 months ago
Upright-Quad Drawing of st -Planar Learning Spaces
We consider graph drawing algorithms for learning spaces, a type of st-oriented partial cube derived from an antimatroid and used to model states of knowledge of students. We show...
David Eppstein
IJCV
2006
192views more  IJCV 2006»
15 years 7 months ago
Piecewise-Smooth Dense Optical Flow via Level Sets
We propose a new algorithm for dense optical flow computation. Dense optical flow schemes are challenged by the presence of motion discontinuities. In state of the art optical flo...
Tomer Amiaz, Nahum Kiryati
IWC
1998
109views more  IWC 1998»
15 years 6 months ago
About the importance of auditory alarms during the operation of a plant simulator
An experiment was carried out to estimate the effect of auditory alarms on the work of an plant operator in the context of a computer simulation. We designed our process simulator...
Matthias Rauterberg
PUC
2010
139views more  PUC 2010»
15 years 5 months ago
Digital plumbing: the mundane work of deploying UbiComp in the home
Deploying UbiComp in real homes is central to realizing Weiserʼs grand vision of ʻinvisibleʼ computing. It is essential to moving design out of the lab and making it into an unr...
Peter Tolmie, Andy Crabtree, Stefan Rennick Eggles...