Automata on infinite words (ω-automata) have wide applications in formal language theory as well as in modeling and verifying reactive systems. Complementation of ωautomata is ...
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
Abstract. We provide a new characterization of certain zero-knowledge protocols as non-interactive instance-dependent commitment-schemes (NIC). To obtain this result we consider th...
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, ...
In this work we apply the Basis Pursuit (BP) methodology for recovering the intra-voxel information in Diffusion Weighted MR Images (DW-MRI). We compare the BP approach with a Dif...