511 search results - page 34 / 103 » More Precise Partition Abstractions |
122
Voted
CADE
2007
Springer
16 years 3 months ago
2007
Springer
Abstract. Automata-based decision procedures commonly achieve optimal complexity bounds. However, in practice, they are often outperformed by sub-optimal (but more local-search bas...
ESA
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. In this paper, we show that algorithms on tree decompositions can be made faster with the use of generalisations of fast subset convolution. Amongst others, this gives al...
93
Voted
COLT
2004
Springer
15 years 8 months ago
2004
Springer
Abstract— We prove that given a nearly log-concave distribution, in any partition of the space to two well separated sets, the measure of the points that do not belong to these s...
124
Voted
HUC
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. As low-level architectural support for context-aware computing matures, we are ready to explore more general and powerful means of accessing context data. Information req...
156
Voted
ACPC
1999
Springer
15 years 7 months ago
1999
Springer
Abstract. A number of techniques are described for solving sparse linear systems on parallel platforms. The general approach used is a domaindecomposition type method in which a pr...