Sciweavers

4131 search results - page 293 / 827
» The Generalized Max-Controlled Set Problem
Sort
View
ICML
2008
IEEE
16 years 5 months ago
Multiple instance ranking
This paper introduces a novel machine learning model called multiple instance ranking (MIRank) that enables ranking to be performed in a multiple instance learning setting. The mo...
Charles Bergeron, Jed Zaretzki, Curt M. Breneman, ...
137
Voted
STOC
2002
ACM
159views Algorithms» more  STOC 2002»
16 years 4 months ago
On the composition of authenticated byzantine agreement
A fundamental problem of distributed computing is that of simulating a secure broadcast channel, within the setting of a point-to-point network. This problem is known as Byzantine...
Yehuda Lindell, Anna Lysyanskaya, Tal Rabin
STACS
2010
Springer
15 years 11 months ago
Exact Covers via Determinants
Given a k-uniform hypergraph on n vertices, partitioned in k equal parts such that every hyperedge includes one vertex from each part, the k-Dimensional Matching problem asks wheth...
Andreas Björklund
123
Voted
GD
2007
Springer
15 years 10 months ago
Moving Vertices to Make Drawings Plane
In John Tantalo’s on-line game Planarity the player is given a non-plane straight-line drawing of a planar graph. The aim is to make the drawing plane as quickly as possible by m...
Xavier Goaoc, Jan Kratochvíl, Yoshio Okamot...
HM
2007
Springer
120views Optimization» more  HM 2007»
15 years 10 months ago
On the Combination of Constraint Programming and Stochastic Search: The Sudoku Case
Sudoku is a notorious logic-based puzzle that is popular with puzzle enthusiasts the world over. From a computational perspective, Sudoku is also a problem that belongs to the set ...
Rhydian Lewis