1805 search results - page 16 / 361 » A Theory of Closure Operators |
133
Voted
CDC
2008
IEEE
15 years 10 months ago
2008
IEEE
A common method for constructing a function from a finite set of moments is to solve a constrained minimization problem. The idea is to find, among all functions with the given ...
112
click to vote
ICPR
2008
IEEE
15 years 10 months ago
2008
IEEE
In the past, clusterings combination approaches are based on “flat” clustering algorithms, i.e. algorithms that operate on non-hierarchical clustering schemes. These approache...
125
click to vote
DLOG
2009
15 years 1 months ago
2009
Abstract. Generalized closed world reasoning allows for the assumption of a specified maximal set of negated atomic assertions retaining the consistency of an indefinite knowledge ...
111
click to vote
FSTTCS
2007
Springer
15 years 10 months ago
2007
Springer
There are two somewhat contradictory ways of looking at modules in a given programming language. On the one hand, module systems are largely independent of the particulars of progr...
121
click to vote
TVLSI
2002
15 years 3 months ago
2002
In this paper, we deal with arbitrarily shaped rectilinear module placement using the transitive closure graph (TCG) representation. The geometric meanings of modules are transpare...