Sciweavers

2019 search results - page 256 / 404
» Programming with Shared Data Abstractions
Sort
View
RECOMB
2006
Springer
16 years 3 months ago
Efficient Enumeration of Phylogenetically Informative Substrings
We study the problem of enumerating substrings that are common amongst genomes that share evolutionary descent. For example, one might want to enumerate all identical (therefore co...
Stanislav Angelov, Boulos Harb, Sampath Kannan, Sa...
ISSAC
2007
Springer
128views Mathematics» more  ISSAC 2007»
15 years 9 months ago
Productivity and performance using partitioned global address space languages
Partitioned Global Address Space (PGAS) languages combine the programming convenience of shared memory with the locality and performance control of message passing. One such langu...
Katherine A. Yelick, Dan Bonachea, Wei-Yu Chen, Ph...
ALMOB
2006
138views more  ALMOB 2006»
15 years 3 months ago
A combinatorial optimization approach for diverse motif finding applications
Background: Discovering approximately repeated patterns, or motifs, in biological sequences is an important and widely-studied problem in computational molecular biology. Most fre...
Elena Zaslavsky, Mona Singh
HVEI
2010
15 years 3 months ago
Preference for art: similarity, statistics, and selling price
Factors governing human preference for artwork have long been studied but there remain many holes in our understanding. Bearing in mind contextual factors (both the conditions und...
Daniel J. Graham, Jay D. Friedenberg, Cyrus H. McC...
CLUSTER
2007
IEEE
15 years 9 months ago
Performance analysis of a user-level memory server
Abstract—Large-scale parallel applications often produce immense quantities of data that need to be analyzed. To avoid performing repeated, costly disk accesses, analysis of larg...
Scott Pakin, Greg Johnson