Sciweavers

825 search results - page 89 / 165
» Partitions of an Integer into Powers
Sort
View
CC
2007
Springer
158views System Software» more  CC 2007»
14 years 12 months ago
The Complexity of Membership Problems for Circuits Over Sets of Natural Numbers
Abstract. The problem of testing membership in the subset of the natural numbers produced at the output gate of a {∪, ∩,− , +, ×} combinational circuit is shown to capture a...
Pierre McKenzie, Klaus W. Wagner
MOC
1998
98views more  MOC 1998»
14 years 11 months ago
Distribution of irreducible polynomials of small degrees over finite fields
D. Wan very recently proved an asymptotic version of a conjecture of Hansen and Mullen concerning the distribution of irreducible polynomials over finite fields. In this note we ...
Kie H. Ham, Gary L. Mullen
JAIR
2010
115views more  JAIR 2010»
14 years 10 months ago
An Investigation into Mathematical Programming for Finite Horizon Decentralized POMDPs
Decentralized planning in uncertain environments is a complex task generally dealt with by using a decision-theoretic approach, mainly through the framework of Decentralized Parti...
Raghav Aras, Alain Dutech
ICDM
2003
IEEE
158views Data Mining» more  ICDM 2003»
15 years 5 months ago
Combining Multiple Weak Clusterings
A data set can be clustered in many ways depending on the clustering algorithm employed, parameter settings used and other factors. Can multiple clusterings be combined so that th...
Alexander P. Topchy, Anil K. Jain, William F. Punc...
COMBINATORICA
2006
137views more  COMBINATORICA 2006»
14 years 12 months ago
Extremal Problems For Transversals In Graphs With Bounded Degree
We introduce and discuss generalizations of the problem of independent transversals. Given a graph property R, we investigate whether any graph of maximum degree at most d with a ...
Tibor Szabó, Gábor Tardos