2040 search results - page 116 / 408 » Approximate Expectation Maximization |
113
click to vote
COLT
2000
Springer
15 years 7 months ago
2000
Springer
We study model selection strategies based on penalized empirical loss minimization. We point out a tight relationship between error estimation and data-based complexity penalizatio...
105
Voted
IRI
2006
IEEE
15 years 9 months ago
2006
IEEE
— Maximal full rectangles in tabular data are useful in several areas of data engineering. This paper presents a survey of results in which we replace “full rectangles” by ...
159
click to vote
FSTTCS
2001
Springer
15 years 7 months ago
2001
Springer
Consider a directed graph G = (V, E) with n vertices and a root vertex r ∈ V . The DMDST problem for G is one of constructing a spanning tree rooted at r, whose maximal degree is...
127
Voted
TAMC
2007
Springer
15 years 9 months ago
2007
Springer
We study non-overlapping axis-parallel packings of 3D boxes with profits into a dedicated bigger box where rotation is either forbidden or permitted; we wish to maximize the total...
125
click to vote
ATMOS
2007
15 years 4 months ago
2007
Abstract. Approximate dynamic programming offers a new modeling and algorithmic strategy for complex problems such as rail operations. Problems in rail operations are often modeled...