Many program-analysis problems can be formulated as graph-reachability problems. Interleaved Dyck language reachability ( InterDyck -reachability) is a fundamental framework to express wide variety of over edge-labeled graphs. The represents an intersection multiple matched-parenthesis languages (i.e., languages). In practice, program analyses typically leverage one achieve context-sensitivity,...

Fluorescence fluctuation imaging is a powerful means to investigate dynamics, interactions, and stoichiometry of proteins inside living cells. Pulsed interleaved excitation (PIE) is the method of nanosecond alternating excitation with time-resolved detection and allows accurate, independent, and quasi-simultaneous determination of fluorescence intensities and lifetimes of different fluorophores...

We present a detailed experimental comparison of interleaved depth-rst search and depth-bounded discrepancy search, two tree search procedures recently developed with the same goal: to reduce the cost of heuristic mistakes at the top of the tree. Our comparison uses an abstract heur-istic model, and three diierent concrete problem classes: binary constraint satisfaction, quasigroup completion a...

We describe an approach to bounded-memory computation of persistent homology and betti barcodes, in which a computational state is maintained with updates introducing new edges to the underlying neighbourhood graph and percolating the resulting changes into the simplex stream feeding the persistence algorithm. We further discuss the memory consumption and resulting speed and complexity behaviou...

Historically, figure-ground segmentation has been seen as an important and even necessary precursor for object recognition. In that context, segmentation is mostly defined as a data driven, that is bottom-up, process. As for humans object recognition and segmentation are heavily intertwined processes, it has been argued that top-down knowledge from object recognition can and should be used for ...