Sciweavers

352 search results - page 22 / 71
» On implementation choices for iterative improvement partitio...
Sort
View
TPDS
2002
136views more  TPDS 2002»
13 years 9 months ago
Automatic Partitioning of Parallel Loops with Parallelepiped-Shaped Tiles
In this paper, an efficient algorithm to implement loop partitioning is introduced and evaluated. We start from results of Agarwal et al. [1] whose aim is to minimize the number of...
Fabrice Rastello, Yves Robert
ICPR
2008
IEEE
14 years 11 months ago
Active query selection for semi-supervised clustering
Semi-supervised clustering allows a user to specify available prior knowledge about the data to improve the clustering performance. A common way to express this information is in ...
Anil K. Jain, Pavan Kumar Mallapragada, Rong Jin
ICASSP
2008
IEEE
14 years 4 months ago
A turbo-style algorithm for lexical baseforms estimation
In this research, an iterative and unsupervised Turbo-style algorithm is presented and implemented for the task of automatic lexical acquisition. The algorithm makes use of spoken...
Ghinwa F. Choueiter, Mesrob I. Ohannessian, Stepha...
APPROX
2006
Springer
126views Algorithms» more  APPROX 2006»
14 years 1 months ago
Better Approximations for the Minimum Common Integer Partition Problem
Abstract. In the k-Minimum Common Integer Partition Problem, abbreviated k-MCIP, we are given k multisets X1, . . . , Xk of positive integers, and the goal is to find an integer mu...
David P. Woodruff
AAAI
2011
12 years 10 months ago
Pushing the Power of Stochastic Greedy Ordering Schemes for Inference in Graphical Models
We study iterative randomized greedy algorithms for generating (elimination) orderings with small induced width and state space size - two parameters known to bound the complexity...
Kalev Kask, Andrew Gelfand, Lars Otten, Rina Decht...