We introduce a new approach for drawing diagrams. Our approach is to use a technique we call confluent drawing for visualizing non-planar graphs in a planar way. This approach all...
Matthew Dickerson, David Eppstein, Michael T. Good...
We examine the computational complexity of testing and nding small plans in probabilistic planning domains with both at and propositional representations. The complexity of plan e...
Michael L. Littman, Judy Goldsmith, Martin Mundhen...
Using an improved backtrack algorithm with sophisticated pruning techniques, we revise previous observations correlating a high frequency of hard to solve Hamiltonian cycle instan...
We develop a method for predicting query performance by computing the relative entropy between a query language model and the corresponding collection language model. The resultin...
Mobile multimedia applications, the focus of many forthcoming wireless services, increasingly demand low-power techniques implementing content protection and customer privacy. In t...