4212 search results - page 308 / 843 » On Compressible Pairings and Their Computation |
176
click to vote
CP
2008
Springer
15 years 8 months ago
2008
Springer
We introduce the SoftAllEqual global constraint, which maximizes the number of equalities holding between pairs of assignments to a set of variables. We study the computational com...
183
click to vote
ESA
2008
Springer
15 years 8 months ago
2008
Springer
For a set P of n points in R2 , the Euclidean 2-center problem computes a pair of congruent disks of the minimal radius that cover P. We extend this to the (2, k)-center problem wh...
165
click to vote
ACL
2006
15 years 8 months ago
2006
Partial cognates are pairs of words in two languages that have the same meaning in some, but not all contexts. Detecting the actual meaning of a partial cognate in context can be ...
154
click to vote
COLING
1992
15 years 8 months ago
1992
We propose a new method to resolve ambiguity in translation and meaning interpretation using linguistic statistics extracted from dual corpora of sourcu aud target languages in ad...
180
Voted
ACTA
2007
15 years 7 months ago
2007
Abstract Computing frequent itemsets is one of the most prominent problems in data mining. Recently, a new related problem, called FREQSAT, was introduced and studied: given some i...