Sciweavers

1826 search results - page 167 / 366
» Using Random Forests in the Structured Language Model
Sort
View
TSP
2008
151views more  TSP 2008»
15 years 4 months ago
Convergence Analysis of Reweighted Sum-Product Algorithms
Markov random fields are designed to represent structured dependencies among large collections of random variables, and are well-suited to capture the structure of real-world sign...
Tanya Roosta, Martin J. Wainwright, Shankar S. Sas...
ECOOP
2006
Springer
15 years 8 months ago
Managing the Evolution of Aspect-Oriented Software with Model-Based Pointcuts
In spite of the more advanced modularisation mechanisms, aspect-oriented programs still suffer from evolution problems. Due to the fragile pointcut problem, seemingly safe modifica...
Andy Kellens, Kim Mens, Johan Brichau, Kris Gybels
141
Voted
AGTIVE
2003
Springer
15 years 10 months ago
Modeling Discontinuous Constituents with Hypergraph Grammars
Discontinuous constituent are a frequent problem in natural language analyses. A constituent is called discontinuous if it is interrupted by other constituents. In German they can ...
Ingrid Fischer
VISUALIZATION
1992
IEEE
15 years 9 months ago
Display of Scientific Data Structures for Algorithm Visualization
algorithms as networks of modules. The data flow architecture is popular because of the flexibility of mixing calculation modules with display modules, and because of its easy grap...
William L. Hibbard, Charles R. Dyer, Brian E. Paul
ER
2010
Springer
164views Database» more  ER 2010»
15 years 3 months ago
Querying Databases with Taxonomies
Traditional information search in which queries are posed against a known and rigid schema over a structured database is shifting towards a Web scenario in which exposed schemas ar...
Davide Martinenghi, Riccardo Torlone