Sciweavers

15254 search results - page 11 / 3051
» A k
Sort
View
ALGORITHMICA
2006
94views more  ALGORITHMICA 2006»
13 years 9 months ago
Efficient Algorithms for k Maximum Sums
We study the problem of computing the k maximum sum subsequences. Given a sequence of real numbers x1, x2, . . . , xn and an integer parameter k, 1 k 1 2 n(n - 1), the problem in...
Fredrik Bengtsson, Jingsen Chen
CORR
2006
Springer
123views Education» more  CORR 2006»
13 years 9 months ago
Counting good truth assignments of random k-SAT formulae
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...
Andrea Montanari, Devavrat Shah
CORR
2011
Springer
138views Education» more  CORR 2011»
13 years 1 months ago
Many collinear k-tuples with no k+1 collinear points
For every k > 3, we give a construction of planar point sets with many collinear k-tuples and no collinear (k + 1)-tuples.
József Solymosi, Milos Stojakovic
PODS
2004
ACM
158views Database» more  PODS 2004»
14 years 9 months ago
k-Means Projective Clustering
Pankaj K. Agarwal, Nabil H. Mustafa
CIDM
2007
IEEE
14 years 4 months ago
K2GA: Heuristically Guided Evolution of Bayesian Network Structures from Data
— We present K2GA, an algorithm for learning Bayesian network structures from data. K2GA uses a genetic algorithm to perform stochastic search, while employing a modified versio...
Eli Faulkner