Sciweavers

4930 search results - page 53 / 986
» Learning minimal abstractions
Sort
View
ALGORITHMICA
2004
112views more  ALGORITHMICA 2004»
15 years 4 months ago
Maximum Cardinality Search for Computing Minimal Triangulations of Graphs
Abstract. We present a new algorithm, called MCS-M, for computing minimal triangulations of graphs. LexBFS, a seminal algorithm for recognizing chordal graphs, was the genesis for ...
Anne Berry, Jean R. S. Blair, Pinar Heggernes, Bar...
73
Voted
CDC
2009
IEEE
104views Control Systems» more  CDC 2009»
15 years 8 months ago
Minimization of length and curvature on planar curves
Abstract— In this paper we consider the problem of reconstructing a curve that is partially hidden or corrupted by minimizing the functional R √ 1 + K2 ds, depending both on le...
Ugo V. Boscain, Gregoire Charlot, Francesco Rossi
IJCAI
2001
15 years 5 months ago
Causality and Minimal Change Demystified
The Principle of Minimal Change is prevalent in various guises throughout the development of areas such as reasoning about action, belief change and nonmonotonic reasoning. Recent...
Maurice Pagnucco, Pavlos Peppas
JCC
2008
85views more  JCC 2008»
15 years 4 months ago
Minimal molecular surfaces and their applications
Abstract: This article presents a novel concept, the minimal molecular surface (MMS), for the theoretical modeling of biomolecules. The MMS can be viewed as a result of the surface...
P. W. Bates, G. W. Wei, Shan Zhao
CORR
2010
Springer
144views Education» more  CORR 2010»
15 years 4 months ago
Efficient Minimization of Decomposable Submodular Functions
Many combinatorial problems arising in machine learning can be reduced to the problem of minimizing a submodular function. Submodular functions are a natural discrete analog of co...
Peter Stobbe, Andreas Krause