1378 search results - page 80 / 276 » The Tractability of Global Constraints |
130
click to vote
MICCAI
2009
Springer
16 years 7 months ago
2009
Springer
Abstract. We show that a simple probabilistic modelling of the registration problem for surfaces allows to solve it by using standard clustering techniques. In this framework, poin...
149
click to vote
ACL
2006
15 years 7 months ago
2006
The ability to compress sentences while preserving their grammaticality and most of their meaning has recently received much attention. Our work views sentence compression as an o...
160
click to vote
ATAL
2003
Springer
15 years 11 months ago
2003
Springer
We present a new polynomial-space algorithm, called Adopt, for distributed constraint optimization (DCOP). DCOP is able to model a large class of collaboration problems in multi-a...
155
click to vote
CP
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. In an increasing number of domains such as bioinformatics, combinatorial graph problems arise. We propose a novel way to solve these problems, mainly those that can be tr...
150
click to vote
MOBICOM
2005
ACM
15 years 11 months ago
2005
ACM
This paper is a contribution to the generic problem of having simple and accurate models to dimension radio cells with data traffic on a GPRS or EDGE network. It addresses the iss...