50 search results - page 7 / 10 » Improved Algorithms for the K-Maximum Subarray Problem for S... |
AAAI
2010
13 years 8 months ago
2010
We consider approval voting elections in which each voter votes for a (possibly empty) set of candidates and the outcome consists of a set of k candidates for some parameter k, e....
LATIN
2010
Springer
14 years 2 months ago
2010
Springer
Many divide-and-conquer algorithms employ the fact that the vertex set of a graph of bounded treewidth can be separated in two roughly balanced subsets by removing a small subset o...
PVLDB
2010
13 years 5 months ago
2010
This paper introduces a new definition of dense subgraph pattern, the DN-graph. DN-graph considers both the size of the sub-structure and the minimum level of interactions betwee...
ICIP
2002
IEEE
14 years 9 months ago
2002
IEEE
Coupling the periodic time-invariance of the wavelet transform with the view of thresholding as a projection yields a simple, recursive, wavelet-based technique for denoising sign...
SOFSEM
2007
Springer
14 years 1 months ago
2007
Springer
Prior algorithms known for exactly solving Max 2-Sat improve upon the trivial upper bound only for very sparse instances. We present new algorithms for exactly solving (in fact, c...