Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
Abraham Bachrach, Kevin Chen, Chris Harrelson, Rad...
Searching approximate nearest neighbors in large scale high dimensional data set has been a challenging problem. This paper presents a novel and fast algorithm for learning binary...
In fluorescence microscopy the noise level and the photobleaching are cross-dependent problems since reducing exposure time to reduce photobleaching degrades image quality while ...
Marcio de Moraes Marim, Elsa D. Angelini, Jean-Chr...
This paper reports on two experiments we conducted to look at how to design effective linear and circular apparent-motion displays. Using a two-tactor array on the upper arm, the ...
Masataka Niwa, Robert W. Lindeman, Yuichi Itoh, Fu...
Should we use build and deployment teams on large projects? Build and deployment work often emerges as a specialization on project teams. This specialization becomes important on ...