Sciweavers

452 search results - page 23 / 91
» Finding bugs is easy
Sort
View
ASPLOS
2011
ACM
12 years 11 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...
BMCBI
2006
145views more  BMCBI 2006»
13 years 8 months ago
Fast-Find: A novel computational approach to analyzing combinatorial motifs
Background: Many vital biological processes, including transcription and splicing, require a combination of short, degenerate sequence patterns, or motifs, adjacent to defined seq...
Micah Hamady, Erin Peden, Rob Knight, Ravinder Sin...
BMCBI
2008
115views more  BMCBI 2008»
13 years 8 months ago
PARPST: a PARallel algorithm to find peptide sequence tags
Background: Protein identification is one of the most challenging problems in proteomics. Tandem mass spectrometry provides an important tool to handle the protein identification ...
Sara Brunetti, Elena Lodi, Elisa Mori, Maria Stell...
MIR
2004
ACM
101views Multimedia» more  MIR 2004»
14 years 1 months ago
Leveraging face recognition technology to find and organize photos
With digital still cameras, users can easily collect thousands of photos. We have created a photo management application with the goal of making photo organization and browsing si...
Andreas Girgensohn, John Adcock, Lynn Wilcox
PLDI
2010
ACM
14 years 1 months ago
Finding low-utility data structures
Many opportunities for easy, big-win, program optimizations are missed by compilers. This is especially true in highly layered Java applications. Often at the heart of these misse...
Guoqing Xu, Nick Mitchell, Matthew Arnold, Atanas ...