Sciweavers

1617 search results - page 161 / 324
» Constraints in Weighted Averaging
Sort
View
109
Voted
IJCAI
2007
15 years 2 months ago
Recursive Random Fields
A formula in first-order logic can be viewed as a tree, with a logical connective at each node, and a knowledge base can be viewed as a tree whose root is a conjunction. Markov l...
Daniel Lowd, Pedro Domingos
IPCO
1998
99views Optimization» more  IPCO 1998»
15 years 2 months ago
Non-approximability Results for Scheduling Problems with Minsum Criteria
We provide several non-approximability results for deterministic scheduling problems whose objective is to minimize the total job completion time. Unless P = NP, none of the probl...
Han Hoogeveen, Petra Schuurman, Gerhard J. Woeging...
114
Voted
ICML
2010
IEEE
15 years 1 months ago
Boosting Classifiers with Tightened L0-Relaxation Penalties
We propose a novel boosting algorithm which improves on current algorithms for weighted voting classification by striking a better balance between classification accuracy and the ...
Noam Goldberg, Jonathan Eckstein
99
Voted
JSAC
2008
85views more  JSAC 2008»
15 years 23 days ago
A distributed minimum variance estimator for sensor networks
A distributed estimation algorithm for sensor networks is proposed. A noisy time-varying signal is jointly tracked by a network of sensor nodes, in which each node computes its es...
Alberto Speranzon, Carlo Fischione, Karl Henrik Jo...
JMLR
2006
124views more  JMLR 2006»
15 years 23 days ago
A Direct Method for Building Sparse Kernel Learning Algorithms
Many kernel learning algorithms, including support vector machines, result in a kernel machine, such as a kernel classifier, whose key component is a weight vector in a feature sp...
Mingrui Wu, Bernhard Schölkopf, Gökhan H...