Found 4139 results
[ Author(Desc)] Title Type Year
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
Beamer, S., Asanović K., & Patterson D. (2012).  Direction-Optimizing Breadth-First Search.
Beamer, S., Asanović K., & Patterson D. (2011).  Searching for a Parent Instead of Fighting Over Children: A Fast Breadth-First Search Implementation for Graph500.
Beamer, S., Buluç A., Asanović K., & Patterson D. (2013).  Distributed Memory Breadth-First Search Revisited: Enabling Bottom-Up Search.
Beck, J. (1990).  The Ring Array Processor (RAP): Hardware.
Beck, J., Morgan N., Allman A.., & Beer J. (1989).  A Multi-DSP Ring Array for Connectionist Simulations. Proceedings of 23rd Asilomar Conference on Signals, Systems & Computers.
Becker, B., Drechsler R., & Theobald M. (1994).  On Variable Ordering of Ordered Functional Decision Diagrams.
Becker, B., Drechsler R., & Werchner R. (1994).  On the Relation Between BDDs and FDDs.
Beckman, K.. B., Abel K.. A., Braun A.., & Halperin E. (2006).  Using DNA Pools for Genotyping Trios. Nucleic Acids Research. 34(19), 
Beer, J. (1990).  A Pipelining Model Which Pipelines Blocks of Code.
Behandish, M., & Shapiro V. (2017).  A Guide to Property-Based Interoperability.
Behrendt, T., Compton K., & Grdel E. (1993).  Optimization Problems: Expressibility, Approximation Properties and Expected Asymptotic Growth of Optimal Solutions.
Beigel, R. (1992).  Communicating with Low-Diffraction Lasers and Mirrors.
Beijbom, O., Hoffman J., Yao E., Darrell T., Rodriguez-Ramirez A., Gonzalez-Rivero M., et al. (2015).  Quantification in-the-wild: data-sets and baselines. CoRR. abs/1510.04811,
Beilner, H. (1988).  Measuring with Slow Clocks.
Bell, O., Allman M., & Kuperman B. (2012).  On Browser-Level Event Logging.
Bell, A., Jurafsky D., Fosler-Lussier E., Girand C., & Gildea D. (1999).  Forms of English Function Words - Effects of Disfluencies, Turn Position, Age and Sex, and Predictability. Proceedings of the International Congress of Phonetic Sciences. 1, 395-398.
Ben-David, S., Chor B., Goldreich O., & Luby M. (1989).  Towards a Theory of Average Case Complexity.
Ben-David, S., Borodin A., Karp R. M., Tardos G., & Wigderson A. (1990).  On the Power of Randomization in Online Algorithms.
Ben-David, S., Borodin A., Karp R. M., Tardos G., & Wigderson A. (1994).  On the power of randomization in on-line algorithms. Algorithmica. 11(1), 2-14.
Ben-David, S., Borodin A., Karp R. M., Tardos G., & Wigderson A. (1990).  On the power of randomization in online algorithms. Proceedings of the 22nd Annual ACM Symposium on Theory of Computing. 379-386.
Ben-David, Y., Hasan S., Pal J., Vallentin M., Panjwani S.., Gutheim P.., et al. (2011).  Computing Security in the Developing World: A Case for Multidisciplinary Research. 39-44.
Ben-David, S., Chor B., Goldreich O., & Luby M. (1989).  On the Theory of Average Case Complexity (Revised Edition).
Ben-Dor, A., Karp R. M., Schwikowski B., & Yakhini Z. (2000).  Universal DNA Tag Systems: A Combinatorial Design Scheme. Proceedings of RECOMB 2000.
Ben-Dor, A., Hartman T., Schwikowski B., Sharan R., & Yakhini Z. (2003).  Towards Optimally Multiplexed Applications of Universal DNA Tag Systems. Proceedings of the Seventh Annual International Conference on Research in Computational Molecular Biology (RECOMB'03).
Ben-Dor, A., Chor B., Karp R. M., & Yakhini Z. (2003).  Discovering Local Structure in Gene Expression Data: The Order-Preserving Submatrix Problem. Journal of Computational Biology. 10(3-4), 385-398.