Sciweavers

2907 search results - page 546 / 582
» Presentations of Structures in Admissible Sets
Sort
View
CHI
2009
ACM
15 years 10 months ago
Two studies of opportunistic programming: interleaving web foraging, learning, and writing code
This paper investigates the role of online resources in problem solving. We look specifically at how programmers--an exemplar form of knowledge workers--opportunistically interlea...
Joel Brandt, Philip J. Guo, Joel Lewenstein, Mira ...
KDD
2009
ACM
191views Data Mining» more  KDD 2009»
15 years 10 months ago
Efficient methods for topic model inference on streaming document collections
Topic models provide a powerful tool for analyzing large text collections by representing high dimensional data in a low dimensional subspace. Fitting a topic model given a set of...
Limin Yao, David M. Mimno, Andrew McCallum
KDD
2007
ACM
227views Data Mining» more  KDD 2007»
15 years 10 months ago
Fast best-effort pattern matching in large attributed graphs
We focus on large graphs where nodes have attributes, such as a social network where the nodes are labelled with each person's job title. In such a setting, we want to find s...
Hanghang Tong, Christos Faloutsos, Brian Gallagher...
KDD
2007
ACM
209views Data Mining» more  KDD 2007»
15 years 10 months ago
Temporal causal modeling with graphical granger methods
The need for mining causality, beyond mere statistical correlations, for real world problems has been recognized widely. Many of these applications naturally involve temporal data...
Andrew Arnold, Yan Liu, Naoki Abe
RECOMB
2003
Springer
15 years 10 months ago
Large scale reconstruction of haplotypes from genotype data
Critical to the understanding of the genetic basis for complex diseases is the modeling of human variation. Most of this variation can be characterized by single nucleotide polymo...
Eleazar Eskin, Eran Halperin, Richard M. Karp