5640 search results - page 509 / 1128 » Parallelizing the Data Cube |
179
click to vote
COCOON
1998
Springer
15 years 9 months ago
1998
Springer
Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...
182
click to vote
BMCBI
2008
15 years 5 months ago
2008
Background: In many research areas it is necessary to find differences between treatment groups with several variables. For example, studies of microarray data seek to find a sign...
150
click to vote
BMCBI
2007
15 years 4 months ago
2007
Background: New high throughput pyrosequencers such as the 454 Life Sciences GS 20 are capable of massively parallelizing DNA sequencing providing an unprecedented rate of output ...
284
Voted
GLVLSI
2011
IEEE
14 years 8 months ago
2011
IEEE
This paper proposes a novel L1 data cache design with dualversioning SRAM cells (dvSRAM) for chip multi-processors (CMP) that implement optimistic concurrency proposals. In this n...
136
click to vote
ECCV
2002
Springer
16 years 6 months ago
2002
Springer
General multi view reconstruction from affine or projective cameras has so far been solved most efficiently using methods of factorizing image data matrices into camera and scene p...