Search Sciweavers | Sciweavers

27

COCOON
2005
Springer

112views Combinatorics» more COCOON 2005»

Improved Algorithms for the K-Maximum Subarray Problem for Small K

14 years 3 months ago

The maximum subarray problem for a one- or two-dimensional array is to ﬁnd the array portion that maiximizes the sum of array elements in it. The K-maximum subarray problem is to...

Sung Eun Bae, Tadao Takaoka

claim paper

Read More »

32

click to vote

ECAI
2004
Springer

143views Artificial Intelligence» more ECAI 2004»

Exploiting Association and Correlation Rules - Parameters for Improving the K2 Algorithm

14 years 3 months ago

Download www.ing.unife.it

A Bayesian network is an appropriate tool to deal with the uncertainty that is typical of real-life applications. Bayesian network arcs represent statistical dependence between dif...

Evelina Lamma, Fabrizio Riguzzi, Sergio Storari

claim paper

Read More »

27

click to vote

ISAAC
2005
Springer

76views Algorithms» more ISAAC 2005»

Improved Algorithms for the k Maximum-Sums Problems

14 years 3 months ago

Download www.csie.ntu.edu.tw

Given a sequence of n real numbers and an integer k, 1 k 1 2 n(n − 1), the k maximum-sum segments problem is to locate the k segments whose sums are the k largest among all poss...

Chih-Huai Cheng, Kuan-Yu Chen, Wen-Chin Tien, Kun-...

claim paper

Read More »

33

click to vote

APPROX
2009
Springer

126views Algorithms» more APPROX 2009»

Improved Inapproximability Results for Maximum k-Colorable Subgraph

14 years 4 months ago

Download www.cs.cmu.edu

We study the maximization version of the fundamental graph coloring problem. Here the goal is to color the vertices of a k-colorable graph with k colors so that a maximum fraction ...

Venkatesan Guruswami, Ali Kemal Sinop

claim paper

Read More »

21

click to vote

SIGCSE
2006
ACM

127views Education» more SIGCSE 2006»

Working together to improve K-12 computer science education

14 years 3 months ago

Download www.cis.uab.edu

Robb Cutler, Chris Stephenson

claim paper