Sciweavers

82 search results - page 9 / 17
» Optimizing RAID for long term data archives
Sort
View
97
Voted
PLDI
2006
ACM
15 years 5 months ago
Optimizing memory transactions
Atomic blocks allow programmers to delimit sections of code as ‘atomic’, leaving the language’s implementation to enforce atomicity. Existing work has shown how to implement...
Timothy L. Harris, Mark Plesko, Avraham Shinnar, D...
105
Voted
FOCS
2000
IEEE
15 years 4 months ago
Nearly Optimal Expected-Case Planar Point Location
We consider the planar point location problem from the perspective of expected search time. We are given a planar polygonal subdivision S and for each polygon of the subdivision t...
Sunil Arya, Theocharis Malamatos, David M. Mount
BMCBI
2010
156views more  BMCBI 2010»
14 years 11 months ago
Mathematical model for empirically optimizing large scale production of soluble protein domains
Background: Efficient dissection of large proteins into their structural domains is critical for high throughput proteome analysis. So far, no study has focused on mathematically ...
Eisuke Chikayama, Atsushi Kurotani, Takanori Tanak...
88
Voted
SIGIR
2004
ACM
15 years 5 months ago
Document clustering via adaptive subspace iteration
Document clustering has long been an important problem in information retrieval. In this paper, we present a new clustering algorithm ASI1, which uses explicitly modeling of the s...
Tao Li, Sheng Ma, Mitsunori Ogihara
SIGMOD
2008
ACM
123views Database» more  SIGMOD 2008»
15 years 11 months ago
Query-based partitioning of documents and indexes for information lifecycle management
Regulations require businesses to archive many electronic documents for extended periods of time. Given the sheer volume of documents and the response time requirements, documents...
Soumyadeb Mitra, Marianne Winslett, Windsor W. Hsu