Sciweavers

1604 search results - page 113 / 321
» Regularization on Discrete Spaces
Sort
View
CP
2004
Springer
14 years 3 months ago
Streamlined Constraint Reasoning
Abstract. We introduce a new approach for focusing constraint reasoning using so-called streamlining constraints. Such constraints partition the solution space to drive the search ...
Carla P. Gomes, Meinolf Sellmann
ISPD
1999
ACM
83views Hardware» more  ISPD 1999»
14 years 2 months ago
Efficient solution of systems of orientation constraints
One subtask in constraint-driven placement is enforcing a set of orientation constraints on the devices being placed. Such constraints are created in order to, for example, implem...
Joseph L. Ganley
COMGEO
2006
ACM
13 years 10 months ago
A new algorithmic approach to the computation of Minkowski functionals of polyconvex sets
An algorithm is proposed for the simultaneous computation of all Minkowski functionals (except for the volume) of sets from the convex ring in Rd discretized with respect to a give...
Simone Klenk, Volker Schmidt, Evgueni Spodarev
MFCS
2005
Springer
14 years 3 months ago
Inverse Monoids: Decidability and Complexity of Algebraic Questions
This paper investigates the word problem for inverse monoids generated by a set Γ subject to relations of the form e = f, where e and f are both idempotents in the free inverse m...
Markus Lohrey, Nicole Ondrusch
NIPS
2004
13 years 11 months ago
Semi-supervised Learning by Entropy Minimization
We consider the semi-supervised learning problem, where a decision rule is to be learned from labeled and unlabeled data. In this framework, we motivate minimum entropy regulariza...
Yves Grandvalet, Yoshua Bengio