Sciweavers

943 search results - page 132 / 189
» How should data structures and algorithms be taught
Sort
View
BIRTHDAY
2010
Springer
13 years 7 months ago
The Architecture Description Language MoDeL
m, modules, types and operations), different kinds of abstractions (functional/data, types/objects etc.) without falling into a loose collection of diagram languages. Considering a...
Peter Klein
BMCBI
2010
136views more  BMCBI 2010»
13 years 8 months ago
Bias correction and Bayesian analysis of aggregate counts in SAGE libraries
Background: Tag-based techniques, such as SAGE, are commonly used to sample the mRNA pool of an organism's transcriptome. Incomplete digestion during the tag formation proces...
Russell L. Zaretzki, Michael A. Gilchrist, William...
KDD
2006
ACM
177views Data Mining» more  KDD 2006»
14 years 8 months ago
Topics over time: a non-Markov continuous-time model of topical trends
This paper presents an LDA-style topic model that captures not only the low-dimensional structure of data, but also how the structure changes over time. Unlike other recent work t...
Xuerui Wang, Andrew McCallum
KDD
2010
ACM
224views Data Mining» more  KDD 2010»
13 years 12 months ago
Multi-label learning by exploiting label dependency
In multi-label learning, each training example is associated with a set of labels and the task is to predict the proper label set for the unseen example. Due to the tremendous (ex...
Min-Ling Zhang, Kun Zhang
HPDC
1997
IEEE
13 years 11 months ago
A Directory Service for Configuring High-Performance Distributed Computations
High-performance execution in distributed computing environments often requires careful selection and configuration not only of computers, networks, and other resources but also o...
Steven Fitzgerald, Ian T. Foster, Carl Kesselman, ...