1805 search results - page 14 / 361 » A Theory of Closure Operators |
114
Voted
PODS
2000
ACM
15 years 7 months ago
2000
ACM
We consider spatial databases in the plane that can be defined by polynomial constraint formulas. Motivated by applications in geographic information systems, we investigate line...
86
Voted
WSC
2000
15 years 4 months ago
2000
This paper presents a model and an analysis done to predict enemy force closure. The simulation replaces a pencil and ruler method that has been used by Department of Defense plan...
156
Voted
LICS
2009
IEEE
15 years 10 months ago
2009
IEEE
Weighted automata are nondeterministic automata with numerical weights on transitions. They can define quantitative languages L that assign to each word w a real number L(w). In ...
114
Voted
AML
2005
15 years 3 months ago
2005
It is proved that the forcing apparatus can be built and set to work in ZFCA (=ZFC minus foundation plus the antifoundation axiom AFA). The key tools for this construction are gre...
125
click to vote
CONCUR
2009
Springer
15 years 10 months ago
2009
Springer
Nondeterministic weighted automata are finite automata with numerical weights on transitions. They define quantitative languages L that assign to each word w a real number L(w). ...