2233 search results - page 175 / 447 » On the Complexity of Theory Curbing |
175
click to vote
LOGCOM
2007
15 years 6 months ago
2007
Structural causal models offer a popular framework for exploring causal concepts. However, due to their limited expressiveness, structural models have difficulties coping with su...
149
click to vote
DCG
2010
15 years 3 months ago
2010
We show that any family of sets uniformly definable in an ominimal structure has an extended compression scheme of size equal to the number of parameters in the defining formula. ...
159
click to vote
CADE
2007
Springer
16 years 6 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...
188
click to vote
CHI
2010
ACM
16 years 1 months ago
2010
ACM
Network visualisations use clustering approaches to simplify the presentation of complex graph structures. We present a novel application of clustering algorithms, which controls ...
172
click to vote
ALDT
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. The stable marriage problem has many practical applications in twosided markets like those that assign doctors to hospitals, students to schools, or buyers to vendors. Mo...