215 search results - page 43 / 43 » On extremal k-outconnected graphs |
IFM
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. The automata-based model checking approach for randomized distributed systems relies on an operational interleaving semantics of the system by means of a Markov decision ...
IPPS
2010
IEEE
13 years 3 months ago
2010
IEEE
We present a number of optimization techniques to compute prefix sums on linked lists and implement them on multithreaded GPUs using CUDA. Prefix computations on linked structures ...
DLOG
2009
13 years 3 months ago
2009
Abstract. GridTest is a framework for testing automated theorem provers using randomly generated formulas. It can be used to run tests locally, in a single computer, or in a comput...
CVPR
2011
IEEE
13 years 22 days ago
2011
IEEE
Representing articulated objects as a graphical model has gained much popularity in recent years, often the root node of the graph describes the global position and orientation of...
INFOCOM
2011
IEEE
12 years 9 months ago
2011
IEEE
—Top-k query has long been an important topic in many fields of computer science. Efficient implementation of the top-k queries is the key for information searching. With the n...