Sciweavers

2045 search results - page 243 / 409
» Learning programming with Erlang
Sort
View
124
Voted
EMNLP
2010
15 years 17 days ago
Turbo Parsers: Dependency Parsing by Approximate Variational Inference
We present a unified view of two state-of-theart non-projective dependency parsers, both approximate: the loopy belief propagation parser of Smith and Eisner (2008) and the relaxe...
André F. T. Martins, Noah A. Smith, Eric P....
119
Voted
PLDI
2004
ACM
15 years 8 months ago
Inducing heuristics to decide whether to schedule
Instruction scheduling is a compiler optimization that can improve program speed, sometimes by 10% or more—but it can also be expensive. Furthermore, time spent optimizing is mo...
John Cavazos, J. Eliot B. Moss
JSW
2008
130views more  JSW 2008»
15 years 2 months ago
A Constraint-Driven Executable Model of Dynamic System Reconfiguration
Dynamic system reconfiguration techniques are presented that can enable the systematic evolution of software systems due to unanticipated changes in specification or requirements. ...
D'Arcy Walsh, Francis Bordeleau, Bran Selic
ML
2008
ACM
109views Machine Learning» more  ML 2008»
15 years 2 months ago
O'browser: objective caml on browsers
We present a way to run Objective Caml programs on a standard, unmodified web browser, with a compatible data representation and execution model, including concurrency. To achieve...
Benjamin Canou, Vincent Balat, Emmanuel Chailloux
121
Voted
ICPP
2008
IEEE
15 years 9 months ago
Parallelization and Characterization of Probabilistic Latent Semantic Analysis
Probabilistic Latent Semantic Analysis (PLSA) is one of the most popular statistical techniques for the analysis of two-model and co-occurrence data. It has applications in inform...
Chuntao Hong, Wenguang Chen, Weimin Zheng, Jiulong...