8413 search results - page 1468 / 1683 » Ordering Problem Subgoals |
129
click to vote
KDD
2004
ACM
16 years 4 months ago
2004
ACM
Astronomy increasingly faces the issue of massive datasets. For instance, the Sloan Digital Sky Survey (SDSS) has so far generated tens of millions of images of distant galaxies, ...
128
Voted
KDD
2002
ACM
16 years 4 months ago
2002
ACM
We propose mixtures of hidden Markov models for modelling clickstreams of web surfers. Hence, the page categorization is learned from the data without the need for a (possibly cumb...
115
click to vote
CHI
2005
ACM
16 years 4 months ago
2005
ACM
In this submission for the CHI05 Development forum, I reflect on my experience leading the Experience Design community of interest of the American Institute of Graphic Arts and su...
152
click to vote
VLSID
2002
IEEE
16 years 4 months ago
2002
IEEE
An important class of problems used widely in both the embedded systems and scientific domains perform memory intensive computations on large data sets. These data sets get to be ...
145
Voted
VLSID
2001
IEEE
16 years 4 months ago
2001
IEEE
In this paper, we propose a new transparent built-in self-test ( TBIST ) method to test multiple embedded memory arrays with various sizes in parallel. First, a new transparent tes...