7123 search results - page 167 / 1425 » The Ordered Set of Rough Sets |
167
click to vote
TLCA
2009
Springer
16 years 1 months ago
2009
Springer
We introduce a Game Semantics where strategies are partial orders, and composition is a generalization of the merging of orders. Building on this, to bridge between Game Semantics ...
164
click to vote
CPM
2004
Springer
15 years 12 months ago
2004
Springer
For a set of rooted, unordered, distinctly leaf-labeled trees, the NP-hard maximum agreement subtree problem (MAST) asks for a tree contained (up to isomorphism or homeomorphism) i...
183
click to vote
KR
1992
Springer
15 years 10 months ago
1992
Springer
Converting complex equations into simpler, more tractable equations usually involves approximation. Approximation is usually done by identifying and removing insignificant terms, ...
155
click to vote
COLING
2002
15 years 6 months ago
2002
We present a quantitative model of word order and movement constraints that enables a simple and uniform treatment of a seemingly heterogeneous collection of linear order phenomena...
140
click to vote
IJON
2006
15 years 6 months ago
2006
We propose simple and fast methods based on nearest neighbors that order objects from high-dimensional data sets from typical points to untypical points. On the one hand, we show ...