3172 search results - page 112 / 635 » On the Random-Self-Reducibility of Complete Sets |
215
click to vote
AAAI
2012
13 years 8 months ago
2012
We explore the problem of assigning heterogeneous tasks to workers with different, unknown skill sets in crowdsourcing markets such as Amazon Mechanical Turk. We first formalize ...
186
click to vote
JGT
2008
15 years 6 months ago
2008
: Given a set F of graphs, a graph G is F-free if G does not contain any member of F as an induced subgraph. We say that F is a degree-sequence-forcing set if, for each graph G in ...
144
click to vote
COMBINATORICS
2000
15 years 6 months ago
2000
The known methods for constructing complete sets of mutually orthogonal frequency squares all yield one of two parameter sets. We show that almost all these constructions can be d...
165
click to vote
AAAI
1990
15 years 7 months ago
1990
We present a strategy for restricting the application of the inference rule paramodulation. The strategy applies to problems in first-order logic with equality and is designed to ...
132
click to vote
ICIP
2005
IEEE
16 years 8 months ago
2005
IEEE
We present a new multiresolution analysis framework for irregular meshes with attributes based on the lifting scheme. We introduce a surface prediction operator to compute the det...