Sciweavers

643 search results - page 35 / 129
» Merge-Based Computation of Minimal Generators
Sort
View
CVPR
2011
IEEE
13 years 4 months ago
Inference for Order Reduction in Markov Random Fields
This paper presents an algorithm for order reduction of factors in High-Order Markov Random Fields (HOMRFs). Standard techniques for transforming arbitrary high-order factors in...
Andrew C. Gallagher, Dhruv Batra, Devi Parikh
ISSAC
2007
Springer
88views Mathematics» more  ISSAC 2007»
14 years 1 months ago
Polynomial-time algorithm for Hilbert series of Borel type ideals
In this paper, it is shown that the Hilbert series of a Borel type ideal may be computed within a complexity which is polynomial in Dn where n + 1 is the number of unknowns and D ...
Amir Hashemi
ALGORITHMICA
1998
81views more  ALGORITHMICA 1998»
13 years 7 months ago
The List Update Problem: Improved Bounds for the Counter Scheme
We consider the problem of dynamic reorganization of a linear list, where requests for the elements are generated randomly with fixed, unknown probabilities. The objective is to ...
Hadas Shachnai, Micha Hofri
TPDS
2002
136views more  TPDS 2002»
13 years 7 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
MP
2010
116views more  MP 2010»
13 years 6 months ago
New techniques for cost sharing in combinatorial optimization games
Combinatorial optimization games form an important subclass of cooperative games. In recent years, increased attention has been given to the issue of finding good cost shares for...
Alberto Caprara, Adam N. Letchford