Sciweavers

2780 search results - page 305 / 556
» Generalizing by Removing Detail
Sort
View
IANDC
2011
148views more  IANDC 2011»
15 years 1 months ago
Building species trees from larger parts of phylogenomic databases
Abstract. Gene trees are leaf-labeled trees inferred from molecular sequences. Due to duplication events arising in genome evolution, gene trees usually have multiple copies of som...
Celine Scornavacca, Vincent Berry, Vincent Ranwez
ISCA
2011
IEEE
522views Hardware» more  ISCA 2011»
14 years 10 months ago
CPPC: correctable parity protected cache
Due to shrinking feature sizes processors are becoming more vulnerable to soft errors. Write-back caches are particularly vulnerable since they hold dirty data that do not exist i...
Mehrtash Manoochehri, Murali Annavaram, Michel Dub...
ASPLOS
2011
ACM
14 years 10 months ago
NV-Heaps: making persistent objects fast and safe with next-generation, non-volatile memories
nt, user-defined objects present an attractive abstraction for working with non-volatile program state. However, the slow speed of persistent storage (i.e., disk) has restricted ...
Joel Coburn, Adrian M. Caulfield, Ameen Akel, Laur...
SIGMOD
2011
ACM
331views Database» more  SIGMOD 2011»
14 years 9 months ago
Query optimization techniques for partitioned tables
Table partitioning splits a table into smaller parts that can be accessed, stored, and maintained independent of one another. From their traditional use in improving query perform...
Herodotos Herodotou, Nedyalko Borisov, Shivnath Ba...
AOSD
2012
ACM
14 years 2 months ago
Reusing non-functional concerns across languages
Emerging languages are often source-to-source compiled to mainstream ones, which offer standardized, fine-tuned implementations of non-functional concerns (NFCs)—including pers...
Myoungkyu Song, Eli Tilevich