Sciweavers

4690 search results - page 315 / 938
» An operational semantics for Scheme
Sort
View
USENIX
2007
15 years 9 months ago
Supporting Practical Content-Addressable Caching with CZIP Compression
Content-based naming (CBN) enables content sharing across similar files by breaking files into positionindependent chunks and naming these chunks using hashes of their contents....
KyoungSoo Park, Sunghwan Ihm, Mic Bowman, Vivek S....
JCIT
2007
133views more  JCIT 2007»
15 years 6 months ago
Reused Page Management for Log-Structured Flash Storage Systems
Recently, a flash memory has become a major database storage in building portable information devices because of its non-volatile, shock-resistant, power-economic nature, and fast...
Changbae Roh, Siwoo Byun
PPSN
2010
Springer
15 years 5 months ago
Threshold Selection, Mitosis and Dual Mutation in Cooperative Co-evolution: Application to Medical 3D Tomography
Abstract. We present and analyse the behaviour of specialised operators designed for cooperative coevolution strategy in the framework of 3D tomographic PET reconstruction. The bas...
Franck Patrick Vidal, Evelyne Lutton, Jean Louchet...
ICDE
2009
IEEE
155views Database» more  ICDE 2009»
16 years 1 months ago
SPROUT: Lazy vs. Eager Query Plans for Tuple-Independent Probabilistic Databases
— A paramount challenge in probabilistic databases is the scalable computation of confidences of tuples in query results. This paper introduces an efficient secondary-storage o...
Dan Olteanu, Jiewen Huang, Christoph Koch
HASKELL
2006
ACM
16 years 22 days ago
Strong types for relational databases
Haskell’s type system with multi-parameter constructor classes and functional dependencies allows static (compile-time) computations to be expressed by logic programming on the ...
Alexandra Silva, Joost Visser