107 search results - page 13 / 22 » A methodology for creating fast wait-free data structures |
BMCBI
2006
13 years 7 months ago
2006
Background: With current technology, vast amounts of data can be cheaply and efficiently produced in association studies, and to prevent data analysis to become the bottleneck of ...
ER
2003
Springer
14 years 18 days ago
2003
Springer
Many Internet-based applications have adopted XML as the standard data exchange format. These XML data are typically stored in its native form, thus creating the need to present XM...
CIKM
2006
Springer
13 years 9 months ago
2006
Springer
In this paper, we propose a fast, memory-efficient, and scalable clustering algorithm for analyzing transactional data. Our approach has three unique features. First, we use the c...
SIGGRAPH
1997
ACM
13 years 11 months ago
1997
ACM
This paper describes the integration of the Berkeley Architectural Walkthrough Program with the National Institute of Standards and Technology’s CFAST fire simulator. The integ...
IEEECGIV
2009
IEEE
14 years 2 months ago
2009
IEEE
A novel patch-based tessellation method for a dual subdivision scheme, the Doo-Sabin subdivision, is presented. Patch-based refinement for face-split subdivision schemes such as ...