Sciweavers

STOC
2009
ACM
120views Algorithms» more  STOC 2009»
16 years 7 months ago
A constant-factor approximation for stochastic Steiner forest
We consider the stochastic Steiner forest problem: suppose we were given a collection of Steiner forest instances, and were guaranteed that a random one of these instances would a...
Anupam Gupta, Amit Kumar
181
Voted
STOC
2009
ACM
271views Algorithms» more  STOC 2009»
16 years 7 months ago
A fast and efficient algorithm for low-rank approximation of a matrix
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
Nam H. Nguyen, Thong T. Do, Trac D. Tran

Source Code
445views
16 years 7 months ago
Blocks
Blocks is an open source modular MATLAB framework which allows the user to avoid needlessly repeating computation. Blocks may be easily used for your own experiments, and comes ...
Brian Fulkerson, Andrea Vedaldi

0
posts
with
0
views
249profile views
harrykris85Student, Msc
NITK

2
posts
with
280
views
299profile views Browse  My Posts »
Daniel L. ElliottStudent, PhD
Colorado State University
I am a Ph.D. student working with Chuck Anderson studying reinforcement learning. I also enjoy high dimensional data issues, mixture models, neural networks, and simple, yet effec...
CP
2009
Springer
16 years 7 months ago
Constraints of Difference and Equality: A Complete Taxonomic Characterisation
Abstract. Many combinatorial problems encountered in practice involve constraints that require that a set of variables take distinct or equal values. The AllDifferent constraint, i...
Emmanuel Hebrard, Dániel Marx, Barry O'Sull...
CP
2009
Springer
16 years 7 months ago
Minimising Decision Tree Size as Combinatorial Optimisation
Decision tree induction techniques attempt to find small trees that fit a training set of data. This preference for smaller trees, which provides a learning bias, is often justifie...
Christian Bessiere, Emmanuel Hebrard, Barry O'Sull...
CP
2009
Springer
16 years 7 months ago
SOGgy Constraints: Soft Open Global Constraints
We investigate soft open constraints. We generalize and unify classes of soft constraints and adapt them to the open setting. We give sufficient conditions for generalized classes ...
Michael J. Maher
CP
2009
Springer
16 years 7 months ago
Exploiting Problem Structure for Solution Counting
This paper deals with the challenging problem of counting the number of solutions of a CSP, denoted #CSP. Recent progress have been made using search methods, such as BTD [15], whi...
Aurélie Favier, Philippe Jégou, Simo...
276
Voted
CP
2009
Springer
16 years 7 months ago
A Constraint on the Number of Distinct Vectors with Application to Localization
Abstract. This paper introduces a generalization of the nvalue constraint that bounds the number of distinct values taken by a set of variables.The generalized constraint (called n...
Gilles Chabert, Luc Jaulin, Xavier Lorca