Sciweavers

10293 search results - page 270 / 2059
» Describing Semistructured Data
Sort
View
CORR
2010
Springer
136views Education» more  CORR 2010»
15 years 5 months ago
Viewpoints: A high-performance high-dimensional exploratory data analysis tool
Scientific data sets continue to increase in both size and complexity. In the past, dedicated graphics systems at supercomputing centers were required to visualize large data sets,...
Paul R. Gazis, C. Levit, Michael J. Way
PODC
2000
ACM
15 years 11 months ago
Garbage collection of timestamped data in Stampede
Stampede is a parallel programming system to facilitate the programming of interactive multimedia applications on clusters of SMPs. In a Stampede application, a variable number of...
Rishiyur S. Nikhil, Umakishore Ramachandran
BMCBI
2010
144views more  BMCBI 2010»
15 years 6 months ago
Finding sRNA generative locales from high-throughput sequencing data with NiBLS
Background: Next-generation sequencing technologies allow researchers to obtain millions of sequence reads in a single experiment. One important use of the technology is the seque...
Daniel MacLean, Vincent Moulton, David J. Studholm...
INFOCOM
2012
IEEE
13 years 9 months ago
Data gathering in networks of bacteria colonies: Collective sensing and relaying using molecular communication
Abstract—The prospect of new biological and industrial applications that require communication in micro-scale, encourages research on the design of bio-compatible communication n...
Arash Einolghozati, Mohsen Sardari, Ahmad Beirami,...
ESOP
2009
Springer
16 years 1 months ago
Amortised Memory Analysis Using the Depth of Data Structures
Hofmann and Jost have presented a heap space analysis [1] that finds linear space bounds for many functional programs. It uses an amortised analysis: assigning hypothetical amount...
Brian Campbell