Sciweavers

3143 search results - page 258 / 629
» Minimization of entropy functionals
Sort
View
AAAI
2008
15 years 7 months ago
Efficiently Exploiting Dependencies in Local Search for SAT
We propose a new local search platform that splits a CNF formula into three sub-components: i) a minimal dependency lattice (representing the core connections between logic gates)...
Duc Nghia Pham, John Thornton, Abdul Sattar
BNCOD
1997
111views Database» more  BNCOD 1997»
15 years 6 months ago
Improved and Optimized Partitioning Techniques in Database Query Processing
Abstract. In this paper we present two improvements to the partitioning process: 1) A new dynamic bu er management strategy is employed to increase the average block size of I/O-tr...
Kjell Bratbergsengen, Kjetil Nørvåg
NIPS
2000
15 years 6 months ago
Algorithms for Non-negative Matrix Factorization
Non-negative matrix factorization (NMF) has previously been shown to be a useful decomposition for multivariate data. Two different multiplicative algorithms for NMF are analyzed....
Daniel D. Lee, H. Sebastian Seung
ICML
2010
IEEE
15 years 5 months ago
Multi-Task Learning of Gaussian Graphical Models
We present multi-task structure learning for Gaussian graphical models. We discuss uniqueness and boundedness of the optimal solution of the maximization problem. A block coordina...
Jean Honorio, Dimitris Samaras
CORR
2007
Springer
80views Education» more  CORR 2007»
15 years 4 months ago
Polygraphs for termination of left-linear term rewriting systems
– We present a methodology for proving termination of left-linear term rewriting systems (TRSs) by using Albert Burroni’s polygraphs, a kind of rewriting systems on algebraic c...
Yves Guiraud