Sciweavers

19866 search results - page 192 / 3974
» Computing all factorizations in ***
Sort
View
CVPR
1997
IEEE
15 years 10 months ago
Learning bilinear models for two-factor problems in vision
In many vision problems, we want to infer two (or more) hidden factors which interact to produce our observations. We may want to disentangle illuminant and object colors in color...
William T. Freeman, Joshua B. Tenenbaum
ICCAD
1995
IEEE
170views Hardware» more  ICCAD 1995»
15 years 10 months ago
Acceleration techniques for dynamic vector compaction
: We present several techniques for accelerating dynamic vector compaction for combinational and sequential circuits. A key feature of all our techniques is that they significantly...
Anand Raghunathan, Srimat T. Chakradhar
BSL
2008
97views more  BSL 2008»
15 years 6 months ago
The Complexity of Orbits of Computably Enumerable Sets
The goal of this paper is to announce there is a single orbit of the c.e. sets with inclusion, E, such that the question of membership in this orbit is 1 1-complete. This result an...
Peter Cholak, Rodney G. Downey, Leo Harrington
BCSHCI
2007
15 years 8 months ago
Mental health issues and pervasive computing
This poster describes work being undertaken in the use of pervasive computing for the treatment of mental health problems. The use of technology to help patients with psychologica...
David J. Haniff
ITICSE
2000
ACM
15 years 11 months ago
Student well-being in a computing department
We describe a project exploring the relationships between factors in the learning environment, student well-being and learning outcomes, in the context of a Computing department. ...
J. R. Davy, K. Audin, M. Barkham, C. Joyner