Sciweavers

234 search results - page 38 / 47
» Lightweight Task Graph Inference for Distributed Application...
Sort
View
ISPAN
2002
IEEE
15 years 4 months ago
Automatic Processor Lower Bound Formulas for Array Computations
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...
Peter R. Cappello, Ömer Egecioglu
SIGSOFT
2009
ACM
15 years 4 months ago
Srijan: a graphical toolkit for sensor network macroprogramming
Macroprogramming is an application development technique for wireless sensor networks (WSNs) where the developer specifies the behavior of the system, as opposed to that of the c...
Animesh Pathak, Mahanth K. Gowda
NN
1997
Springer
174views Neural Networks» more  NN 1997»
15 years 3 months ago
Learning Dynamic Bayesian Networks
Bayesian networks are directed acyclic graphs that represent dependencies between variables in a probabilistic model. Many time series models, including the hidden Markov models (H...
Zoubin Ghahramani
KDD
2007
ACM
136views Data Mining» more  KDD 2007»
16 years 2 days ago
Information genealogy: uncovering the flow of ideas in non-hyperlinked document databases
We now have incrementally-grown databases of text documents ranging back for over a decade in areas ranging from personal email, to news-articles and conference proceedings. While...
Benyah Shaparenko, Thorsten Joachims
AIEDU
2005
185views more  AIEDU 2005»
14 years 11 months ago
A Bayesian Student Model without Hidden Nodes and its Comparison with Item Response Theory
The Bayesian framework offers a number of techniques for inferring an individual's knowledge state from evidence of mastery of concepts or skills. A typical application where ...
Michel C. Desmarais, Xiaoming Pu