Combinatorial Pattern Matching : 10Th Annual Symposium, Cpm 99, Warwick University, Uk, July 22-24, 1999 : Proceedings by Cpm (Symposium) (10Th : 1999 : Warwick University); Crochemore, Maxime, 1947-; Paterson, Michael S; published by Berlin ; New York ; London : Springer
algorithms and Data Structures : 6Th International Workshop, Wads'99, Vancouver, Canada, August 11-14, 1999 : Proceedings by Wads'99 (1999 : Vancouver, Canada); Dehne, F. (Frank), 1960-; published by Berlin ; ...
详细信息
algorithms and Data Structures : 6Th International Workshop, Wads'99, Vancouver, Canada, August 11-14, 1999 : Proceedings by Wads'99 (1999 : Vancouver, Canada); Dehne, F. (Frank), 1960-; published by Berlin ; New York : Springer
Experimental and Efficient algorithms : Second International Workshop, Wea 2003, Ascona, Switzerland, May 26-28, 2003 : Proceedings by Wea 2003 (2003 : Ascona, Switzerland); Jansen, Klaus; published by Berlin ; New Yo...
详细信息
Experimental and Efficient algorithms : Second International Workshop, Wea 2003, Ascona, Switzerland, May 26-28, 2003 : Proceedings by Wea 2003 (2003 : Ascona, Switzerland); Jansen, Klaus; published by Berlin ; New York : Springer
algorithms and Computation : 10Th International Symposium, Isaac'99, Chennai, India, December 16-18, 1999 ; Proceedings by Isaac (Conference); Aggarwal, Alok; Pandu Rangan, C., 1955-; published by Berlin ; London ...
详细信息
algorithms and Computation : 10Th International Symposium, Isaac'99, Chennai, India, December 16-18, 1999 ; Proceedings by Isaac (Conference); Aggarwal, Alok; Pandu Rangan, C., 1955-; published by Berlin ; London : Springer
Algorithm Engineering and Experimentation : International Workshop Alenex '99, Baltimore, Md, Usa, January 15-16, 1999 : Selected Papers by Alenex '99 (1999 : Baltimore, MD.); Goodrich, Michael T; McGeoch, Cat...
详细信息
Algorithm Engineering and Experimentation : International Workshop Alenex '99, Baltimore, Md, Usa, January 15-16, 1999 : Selected Papers by Alenex '99 (1999 : Baltimore, MD.); Goodrich, Michael T; McGeoch, Catherine C., 1959-; published by Berlin ; New York : Springer
Algorithmic Learning Theory : 10Th International Conference, Alt'99, Tokyo, Japan, December 6-8, 1999 : Proceedings by Alt'99 (1999 : Tokyo, Japan); Watanabe, Osamu, 1958-; Yokomori, Takashi; published by Berl...
详细信息
Algorithmic Learning Theory : 10Th International Conference, Alt'99, Tokyo, Japan, December 6-8, 1999 : Proceedings by Alt'99 (1999 : Tokyo, Japan); Watanabe, Osamu, 1958-; Yokomori, Takashi; published by Berlin ; New York : Springer
Algorithmic Learning Theory : 9Th International Conference, Alt '98, Otzenhausen, Germany, October 8-10, 1998 : Proceedings by Alt '98 (1998 : Otzenhausen, Germany); Richter, Michael M., 1938-; published by Be...
详细信息
Algorithmic Learning Theory : 9Th International Conference, Alt '98, Otzenhausen, Germany, October 8-10, 1998 : Proceedings by Alt '98 (1998 : Otzenhausen, Germany); Richter, Michael M., 1938-; published by Berlin ; New York : Springer
The article presents a speech by computer scientist Leslie Lamport, a computer scientist and the 2013 recipient of the Association for Computing Machinery's (ACM's) A.M. Turing Award, entitled 'The Compute...
详细信息
The article presents a speech by computer scientist Leslie Lamport, a computer scientist and the 2013 recipient of the Association for Computing Machinery's (ACM's) A.M. Turing Award, entitled 'The computer Science of Concurrency: The Early Years'. It discusses the history of concurrent algorithms in the 1960s and 1970s. Topics discussed include mutual exclusion, producer-consumer synchronization, and distributed algorithms.
A primary goal of quantum computer science is to find an explanation for the fact that quantum computers are more powerful than classical computers. In this paper I argue that to answer this question is to compare alg...
详细信息
A primary goal of quantum computer science is to find an explanation for the fact that quantum computers are more powerful than classical computers. In this paper I argue that to answer this question is to compare algorithmic processes of various kinds and to describe the possibility spaces associated with these processes. By doing this, we explain how it is possible for one process to outperform its rival. Further, in this and similar examples little is gained in subsequently asking a how-actually question. Once one has explained how-possibly, there is little left to do.
Confocal microscopy of colloids combined with digital image processing has become a powerful tool in soft matter physics and materials science. Together, these techniques enable locating and tracking of more than half...
详细信息
Confocal microscopy of colloids combined with digital image processing has become a powerful tool in soft matter physics and materials science. Together, these techniques enable locating and tracking of more than half a million individual colloidal particles at once. However, despite improvements in locating algorithms that improve position accuracy, it remains challenging to locate all particles in a densely packed, three dimensional colloid without erroneously identifying the same particle more than once. We present a simple iterative algorithm that mitigates both the "missed particle" and "double counting" problems while simultaneously reducing sensitivity to the specific choice of input parameters. It is also useful for analyzing images with spatially varying brightness in which a single set of input parameters is not appropriate for all particles. The algorithm is easy to implement and compatible with existing particle locating software. Published by AIP Publishing.
暂无评论