Probabilistic graphical models such as Bayesian Networks have been increasingly applied to many computer vision problems. Accuracy of inferences in such models depends on the quali...
—Greedy routing is a novel routing paradigm where messages are always forwarded to the neighbor that is closest to the destination. Our main result is a polynomial-time algorithm...
Roland Flury, Sriram V. Pemmaraju, Roger Wattenhof...
We assessed the feasibility of “bridging the digital divide” by training community health advisors (CHAs) from low-income communities to use high-quality Internet-based health...
Thomas K. Houston, Kimberly Robinson, Eta Berner, ...
Traditional approaches to semester-long projects in compiler courses force students to implement the early stages of a compiler in depth; since many students fall behind, they hav...
Abstract. We consider systems of finite automata performing together computation on an input string. Each automaton has its own read head that moves independently of the other head...
Pavol Duris, Tomasz Jurdzinski, Miroslaw Kutylowsk...