1952 search results - page 121 / 391 » Complete partitions of graphs |
128
click to vote
GD
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. Problems in simultaneous graph drawing involve the layout of several graphs on a shared vertex set. This paper describes a Graph Simultaneous Embedding Tool, GraphSET, de...
124
click to vote
ICPP
2007
IEEE
15 years 10 months ago
2007
IEEE
Program parallelization requires mapping computation and data to processing elements. Navigational Programming (NavP), based on the principle of migrating computations, offers a d...
158
click to vote
SIGMOD
2011
ACM
14 years 7 months ago
2011
ACM
Conventional OLTP systems assign each transaction to a worker thread and that thread accesses data, depending on what the transaction dictates. This thread-to-transaction work ass...
119
click to vote
SIGCOMM
2009
ACM
15 years 11 months ago
2009
ACM
To search the web quickly, search engines partition the web index over many machines, and consult every partition when answering a query. To increase throughput, replicas are adde...
146
click to vote
FLAIRS
2004
15 years 5 months ago
2004
er provides new techniques for abstracting the state space of a Markov Decision Process (MDP). These techniques extend one of the recent minimization models, known as -reduction, ...