7123 search results - page 333 / 1425 » The Ordered Set of Rough Sets |
203
click to vote
IJCAI
1997
15 years 8 months ago
1997
We address the problem of introducing preferences into default logic. Two approaches are given, one a generalisation of the other. In the first approach, an ordered default theory...
171
click to vote
AMAI
2005
Springer
15 years 6 months ago
2005
Springer
Mediator systems integrate distributed, heterogeneous and autonomous data sources, but their e ective use requires the solution of hard query optimization problems. This is usuall...
179
click to vote
COMBINATORICS
2004
15 years 6 months ago
2004
A graph G is well-covered if every maximal independent set has the same cardinality. Let sk denote the number of independent sets of cardinality k, and define the independence pol...
170
click to vote
DAM
2000
15 years 6 months ago
2000
The linear-width of a graph G is de ned to be the smallest integer k such that the edges of G can be arranged in a linear ordering e1;:::;er in such a way that for every i = 1;:::...
160
click to vote
ICIP
2001
IEEE
16 years 8 months ago
2001
IEEE
We propose a block motion estimation (ME) algorithm that meets high quality requirements and allows for cost efficient VLSI realizations. It relies on a set of rules common to all...