2107 search results - page 377 / 422 » Computing Small Search Numbers in Linear Time |
ICDT
2001
ACM
14 years 1 months ago
2001
ACM
This paper presents a general methodology for the efficient parallelization of existing data cube construction algorithms. We describe two different partitioning strategies, one f...
LCTRTS
2009
Springer
14 years 3 months ago
2009
Springer
Register file (RF) is extremely vulnerable to soft errors, and traditional redundancy based schemes to protect the RF are prohibitive not only because RF is often in the timing c...
GPEM
2007
13 years 8 months ago
2007
Our rapidly growing knowledge regarding genetic variation in the human genome offers great potential for understanding the genetic etiology of disease. This, in turn, could revolut...
ECCC
2011
13 years 3 months ago
2011
We show two new direct product results in two different models of communication complexity. Our first result is in the model of one-way public-coin model. Let f ⊆ X × Y × Z ...
ICIP
2004
IEEE
14 years 10 months ago
2004
IEEE
We address the automatic recovery of complete 3-D object models from video streams. Usually, complete 3-D models are built by fusing several depth maps, each computed from a small...