3946 search results - page 237 / 790 » The computational complexity of choice sets |
156
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Typechecking consists of statically verifying whether the output of an XML transformation always conforms to an output type for documents satisfying a given input type. In this ge...
234
click to vote
SIGCSE
2009
ACM
16 years 7 months ago
2009
ACM
Complex distributed systems are increasingly important in modern computer science, yet many undergraduate curricula do not give students the opportunity to develop the skill sets ...
182
click to vote
INFOVIS
2003
IEEE
15 years 12 months ago
2003
IEEE
An algorithm is presented for the visualisation of multidimensional abstract data, building on a hybrid model introduced at InfoVis 2002. The most computationally complex stage of...
106
click to vote
ICPR
2010
IEEE
15 years 8 months ago
2010
IEEE
We present a methodology for learning spline-based probabilistic models for sets of contours, proposing a new Monte Carlo variant of the EM algorithm to estimate the parameters of...
137
click to vote
JAR
1998
15 years 6 months ago
1998
It is shown how self-resolving clauses like symmetry or transitivity, or even clauses like condensed detachment, can faithfully be deleted from the clause set thus eliminating or ...