Sciweavers

77 search results - page 11 / 16
» Approximation Lasso Methods for Language Modeling
Sort
View
ICFCA
2007
Springer
15 years 5 months ago
Computing Intensions of Digital Library Collections
We model a Digital Library as a formal context in which objects are documents and attributes are terms describing documents contents. A formal concept is very close to the notion o...
Carlo Meghini, Nicolas Spyratos
89
Voted
FM
2003
Springer
112views Formal Methods» more  FM 2003»
15 years 4 months ago
Structuring Retrenchments in B by Decomposition
Simple retrenchment is briefly reviewed in the B language of J.-R. Abrial [1] as a liberalisation of classical refinement, for the formal description of application developments ...
Michael Poppleton, Richard Banach
NLP
2000
15 years 3 months ago
Monte-Carlo Sampling for NP-Hard Maximization Problems in the Framework of Weighted Parsing
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
Jean-Cédric Chappelier, Martin Rajman
101
Voted
CGF
2010
95views more  CGF 2010»
14 years 11 months ago
Polygonal Surface Advection applied to Strange Attractors
Strange attractors of 3D vector field flows sometimes have a fractal geometric structure in one dimension, and smooth surface behavior in the other two. General flow visualization...
S. Yan, N. Max, K.-L. Ma
BMCBI
2005
163views more  BMCBI 2005»
14 years 11 months ago
CoaSim: A flexible environment for simulating genetic data under coalescent models
Background: Coalescent simulations are playing a large role in interpreting large scale intraspecific sequence or polymorphism surveys and for planning and evaluating association ...
Thomas Mailund, Mikkel H. Schierup, Christian N. S...