1686 search results - page 305 / 338 » Programs as polygraphs: computability and complexity |
IWPEC
2009
Springer
14 years 5 months ago
2009
Springer
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions, such that each partition induces a connected sub...
PODC
2005
ACM
14 years 4 months ago
2005
ACM
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
ICALP
2004
Springer
14 years 4 months ago
2004
Springer
Monadic least fixed point logic MLFP is a natural logic whose expressiveness lies between that of first-order logic FO and monadic second-order logic MSO. In this paper we take ...
CHI
1995
ACM
14 years 2 months ago
1995
ACM
The Modeler is designed using a learner-centered approach [5], with scaffolding to address the specific needs of learners. Scaffolding [3] is an educational term that refers to pro...
NIPS
2007
14 years 11 days ago
2007
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...