2314 search results - page 9 / 463 » Monoids over domains |
114
click to vote
SGP
2004
15 years 3 months ago
2004
We present a method for parameterizing irregularly triangulated input models over polyhedral domains with quadrilateral faces. A combination of center-based clustering techniques ...
189
click to vote
VLDB
2007
ACM
16 years 1 months ago
2007
ACM
Several recent papers have focused on OLAP over imprecise data, where each fact can be a region, instead of a point, in a multidimensional space. They have provided a multiple-wor...
124
click to vote
CADE
2002
Springer
16 years 1 months ago
2002
Springer
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
115
click to vote
DEXA
2008
Springer
15 years 3 months ago
2008
Springer
When issuing user-specific queries, users often have a vaguely defined information need. Skyline queries identify the most "interesting" objects for users' incomplet...
APAL
2007
15 years 1 months ago
2007
We prove that, if V is an effectively given commutative valuation domain such that its value group is dense and archimedean, then the theory of all V -modules is decidable.