10997 search results - page 353 / 2200 » On the Structure of Complete Sets |
137
click to vote
ACL
2008
15 years 8 months ago
2008
We outline the problem of ad hoc rules in treebanks, rules used for specific constructions in one data set and unlikely to be used again. These include ungeneralizable rules, erro...
133
click to vote
NIPS
2003
15 years 8 months ago
2003
We propose an information-theoretic clustering approach that incorporates a pre-known partition of the data, aiming to identify common clusters that cut across the given partition...
152
click to vote
SCM
2003
15 years 8 months ago
2003
Abstract. Motivated by our work on object-oriented Content Management, this paper proposes an extensible formal framework for delta and merging strategies, each applicable to a spe...
215
click to vote
CCCG
2009
15 years 8 months ago
2009
We solve instances of a general class of problems defined as follows: Preprocess a set S of possibly weighted colored geometric objects (e.g. points/orthogonal segments/rectangles...
169
click to vote
CSL
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. We prove "untyping" theorems: in some typed theories (semirings, Kleene algebras, residuated lattices, involutive residuated lattices), typed equations can be d...