340 search results - page 4 / 68 » Clustering with Lower Bound on Similarity |
LICS
2009
IEEE
15 years 4 months ago
2009
IEEE
This paper presents a new lower bound for the discrete strategy improvement algorithm for solving parity games due to V¨oge and Jurdzi´nski. First, we informally show which stru...
ACL
2006
14 years 10 months ago
2006
This paper describes a study of the patterns of translational equivalence exhibited by a variety of bitexts. The study found that the complexity of these patterns in every bitext ...
103
Voted
DATAMINE
2006
14 years 9 months ago
2006
Clipping is the process of transforming a real valued series into a sequence of bits representing whether each data is above or below the average. In this paper, we argue that clip...
CORR
2010
Springer
14 years 6 months ago
2010
Springer
We introduce a new technique for proving kernelization lower bounds, called cross-composition. A classical problem L cross-composes into a parameterized problem Q if an instance o...
AAAI
2010
14 years 7 months ago
2010
We consider in this paper the size of a Decomposable Negation Normal Form (DNNF) that respects a given vtree (known as structured DNNF). This representation of propositional knowl...