Sciweavers

5329 search results - page 99 / 1066
» The Weighted Majority Algorithm
Sort
View
SIGIR
2012
ACM
12 years 15 days ago
Inferring missing relevance judgments from crowd workers via probabilistic matrix factorization
In crowdsourced relevance judging, each crowd worker typically judges only a small number of examples, yielding a sparse and imbalanced set of judgments in which relatively few wo...
Hyun Joon Jung, Matthew Lease
COCOON
2005
Springer
14 years 3 months ago
On-Line Simultaneous Maximization of the Size and the Weight for Degradable Intervals Schedules
We consider the problem of scheduling on-line a sequence of degradable intervals in a set of k identical machines. Our objective is to find a schedule that maximizes simultaneousl...
Fabien Baille, Evripidis Bampis, Christian Lafores...
NN
2000
Springer
192views Neural Networks» more  NN 2000»
13 years 9 months ago
A new algorithm for learning in piecewise-linear neural networks
Piecewise-linear (PWL) neural networks are widely known for their amenability to digital implementation. This paper presents a new algorithm for learning in PWL networks consistin...
Emad Gad, Amir F. Atiya, Samir I. Shaheen, Ayman E...
ICALP
2004
Springer
14 years 3 months ago
A Faster Algorithm for Minimum Cycle Basis of Graphs
Abstract. In this paper we consider the problem of computing a minimum cycle basis in a graph G with m edges and n vertices. The edges of G have non-negative weights on them. The p...
Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Mich...
WEA
2004
Springer
124views Algorithms» more  WEA 2004»
14 years 3 months ago
Experimental Studies of Symbolic Shortest-Path Algorithms
Abstract. Graphs can be represented symbolically by the Ordered Binary Decision Diagram (OBDD) of their characteristic function. To solve problems in such implicitly given graphs, ...
Daniel Sawitzki