[{"abstract":[{"lang":"eng","text":"Geodesic active contours and graph cuts are two standard image segmentation techniques. We introduce a new segmentation method combining some of their benefits. Our main intuition is that any cut on a graph embedded in some continuous space can be interpreted as a contour (in 2D) or a surface (in 3D). We show how to build a grid graph and set its edge weights so that the cost of cuts is arbitrarily close to the length (area) of the corresponding contours (surfaces) for any anisotropic Riemannian metric. There are two interesting consequences of this technical result. First, graph cut algorithms can be used to find globally minimum geodesic contours (minimal surfaces in 3D) under arbitrary Riemannian metric for a given set of boundary conditions. Second, we show how to minimize metrication artifacts in existing graph-cut based methods in vision. Theoretically speaking, our work provides an interesting link between several branches of mathematics -differential geometry, integral geometry, and combinatorial optimization. The main technical problem is solved using Cauchy-Crofton formula from integral geometry."}],"publication_status":"published","_id":"3170","doi":"10.1109/ICCV.2003.1238310","title":"Computing geodesics and minimal surfaces via graph cuts","year":"2003","day":"30","type":"conference","date_updated":"2021-01-12T07:41:33Z","extern":1,"author":[{"last_name":"Boykov","first_name":"Yuri","full_name":"Boykov, Yuri"},{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Vladimir Kolmogorov","first_name":"Vladimir","last_name":"Kolmogorov"}],"quality_controlled":0,"citation":{"ieee":"Y. Boykov and V. Kolmogorov, “Computing geodesics and minimal surfaces via graph cuts,” presented at the ICCV: International Conference on Computer Vision, 2003, vol. 1, pp. 26–33.","ama":"Boykov Y, Kolmogorov V. Computing geodesics and minimal surfaces via graph cuts. In: Vol 1. IEEE; 2003:26-33. doi:<a href=\"https://doi.org/10.1109/ICCV.2003.1238310\">10.1109/ICCV.2003.1238310</a>","chicago":"Boykov, Yuri, and Vladimir Kolmogorov. “Computing Geodesics and Minimal Surfaces via Graph Cuts,” 1:26–33. IEEE, 2003. <a href=\"https://doi.org/10.1109/ICCV.2003.1238310\">https://doi.org/10.1109/ICCV.2003.1238310</a>.","short":"Y. Boykov, V. Kolmogorov, in:, IEEE, 2003, pp. 26–33.","ista":"Boykov Y, Kolmogorov V. 2003. Computing geodesics and minimal surfaces via graph cuts. ICCV: International Conference on Computer Vision vol. 1, 26–33.","mla":"Boykov, Yuri, and Vladimir Kolmogorov. <i>Computing Geodesics and Minimal Surfaces via Graph Cuts</i>. Vol. 1, IEEE, 2003, pp. 26–33, doi:<a href=\"https://doi.org/10.1109/ICCV.2003.1238310\">10.1109/ICCV.2003.1238310</a>.","apa":"Boykov, Y., &#38; Kolmogorov, V. (2003). Computing geodesics and minimal surfaces via graph cuts (Vol. 1, pp. 26–33). Presented at the ICCV: International Conference on Computer Vision, IEEE. <a href=\"https://doi.org/10.1109/ICCV.2003.1238310\">https://doi.org/10.1109/ICCV.2003.1238310</a>"},"status":"public","month":"09","conference":{"name":"ICCV: International Conference on Computer Vision"},"date_created":"2018-12-11T12:01:48Z","publist_id":"3511","intvolume":"         1","publisher":"IEEE","page":"26 - 33","volume":1,"date_published":"2003-09-30T00:00:00Z"},{"publication_status":"published","abstract":[{"text":"Reconstructing a 3-D scene from more than one camera is a classical problem in computer vision. One of the major sources of difficulty is the fact that not all scene elements are visible from all cameras. In the last few years, two promising approaches have been developed 11,12 that formulate the scene reconstruction problem in terms of energy minimization, and minimize the energy using graph cuts. These energy minimization approaches treat the input images symmetrically, handle visibility constraints correctly, and allow spatial smoothness to be enforced. However, these algorithm propose different problem formulations, and handle a limited class of smoothness terms. One algorithm 11 uses a problem formulation that is restricted to two-camera stereo, and imposes smoothness between a pair of cameras. The other algorithm 12 can handle an arbitrary number of cameras, but imposes smoothness only with respect to a single camera. In this paper we give a more general energy minimization formulation for the problem, which allows a larger class of spatial smoothness constraints. We show that our formulation includes both of the previous approaches as special cases, as well as permitting new energy functions. Experimental results on real data with ground truth are also included. ","lang":"eng"}],"doi":"10.1007/978-3-540-45063-4_32","_id":"3171","title":"Generalized multi camera scene reconstruction using graph cuts","day":"26","year":"2003","date_updated":"2021-01-12T07:41:34Z","type":"conference","extern":1,"quality_controlled":0,"author":[{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Vladimir Kolmogorov","last_name":"Kolmogorov","first_name":"Vladimir"},{"last_name":"Zabih","first_name":"Ramin","full_name":"Zabih, Ramin"},{"first_name":"Steven","last_name":"Gortler","full_name":"Gortler, Steven"}],"citation":{"apa":"Kolmogorov, V., Zabih, R., &#38; Gortler, S. (2003). Generalized multi camera scene reconstruction using graph cuts (Vol. 2683, pp. 501–516). Presented at the EMMCVPR: Energy Minimization Methods in Computer Vision and Pattern Recognition, Springer. <a href=\"https://doi.org/10.1007/978-3-540-45063-4_32\">https://doi.org/10.1007/978-3-540-45063-4_32</a>","mla":"Kolmogorov, Vladimir, et al. <i>Generalized Multi Camera Scene Reconstruction Using Graph Cuts</i>. Vol. 2683, Springer, 2003, pp. 501–16, doi:<a href=\"https://doi.org/10.1007/978-3-540-45063-4_32\">10.1007/978-3-540-45063-4_32</a>.","chicago":"Kolmogorov, Vladimir, Ramin Zabih, and Steven Gortler. “Generalized Multi Camera Scene Reconstruction Using Graph Cuts,” 2683:501–16. Springer, 2003. <a href=\"https://doi.org/10.1007/978-3-540-45063-4_32\">https://doi.org/10.1007/978-3-540-45063-4_32</a>.","short":"V. Kolmogorov, R. Zabih, S. Gortler, in:, Springer, 2003, pp. 501–516.","ista":"Kolmogorov V, Zabih R, Gortler S. 2003. Generalized multi camera scene reconstruction using graph cuts. EMMCVPR: Energy Minimization Methods in Computer Vision and Pattern Recognition, LNCS, vol. 2683, 501–516.","ama":"Kolmogorov V, Zabih R, Gortler S. Generalized multi camera scene reconstruction using graph cuts. In: Vol 2683. Springer; 2003:501-516. doi:<a href=\"https://doi.org/10.1007/978-3-540-45063-4_32\">10.1007/978-3-540-45063-4_32</a>","ieee":"V. Kolmogorov, R. Zabih, and S. Gortler, “Generalized multi camera scene reconstruction using graph cuts,” presented at the EMMCVPR: Energy Minimization Methods in Computer Vision and Pattern Recognition, 2003, vol. 2683, pp. 501–516."},"status":"public","date_created":"2018-12-11T12:01:48Z","month":"06","conference":{"name":"EMMCVPR: Energy Minimization Methods in Computer Vision and Pattern Recognition"},"publist_id":"3512","intvolume":"      2683","alternative_title":["LNCS"],"publisher":"Springer","volume":2683,"page":"501 - 516","date_published":"2003-06-26T00:00:00Z"},{"abstract":[{"lang":"eng","text":"We address visual correspondence problems without assuming that scene points have similar intensities in different views. This situation is common, usually due to non-lambertian scenes or to differences between cameras. We use maximization of mutual information, a powerful technique for registering images that requires no a priori model of the relationship between scene intensities in different views. However, it has proven difficult to use mutual information to compute dense visual correspondence. Comparing fixed-size windows via mutual information suffers from the well-known problems of fixed windows, namely poor performance at discontinuities and in low-texture regions. In this paper, we show how to compute visual correspondence using mutual information without suffering from these problems. Using 'a simple approximation, mutual information can be incorporated into the standard energy minimization framework used in early vision. The energy can then be efficiently minimized using graph cuts, which preserve discontinuities and handle low-texture regions. The resulting algorithm combines the accurate disparity maps that come from graph cuts with the tolerance for intensity changes that comes from mutual information."}],"publication_status":"published","_id":"3174","doi":"10.1109/ICCV.2003.1238463","title":"Visual correspondence using energy minimization and mutual information","year":"2003","day":"30","type":"conference","date_updated":"2021-01-12T07:41:35Z","quality_controlled":0,"author":[{"full_name":"Kim, Junhwan","first_name":"Junhwan","last_name":"Kim"},{"full_name":"Vladimir Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir","last_name":"Kolmogorov"},{"first_name":"Ramin","last_name":"Zabih","full_name":"Zabih, Ramin"}],"extern":1,"citation":{"mla":"Kim, Junhwan, et al. <i>Visual Correspondence Using Energy Minimization and Mutual Information</i>. Vol. 2, IEEE, 2003, pp. 1033–40, doi:<a href=\"https://doi.org/10.1109/ICCV.2003.1238463\">10.1109/ICCV.2003.1238463</a>.","apa":"Kim, J., Kolmogorov, V., &#38; Zabih, R. (2003). Visual correspondence using energy minimization and mutual information (Vol. 2, pp. 1033–1040). Presented at the ICCV: International Conference on Computer Vision, IEEE. <a href=\"https://doi.org/10.1109/ICCV.2003.1238463\">https://doi.org/10.1109/ICCV.2003.1238463</a>","ama":"Kim J, Kolmogorov V, Zabih R. Visual correspondence using energy minimization and mutual information. In: Vol 2. IEEE; 2003:1033-1040. doi:<a href=\"https://doi.org/10.1109/ICCV.2003.1238463\">10.1109/ICCV.2003.1238463</a>","ieee":"J. Kim, V. Kolmogorov, and R. Zabih, “Visual correspondence using energy minimization and mutual information,” presented at the ICCV: International Conference on Computer Vision, 2003, vol. 2, pp. 1033–1040.","ista":"Kim J, Kolmogorov V, Zabih R. 2003. Visual correspondence using energy minimization and mutual information. ICCV: International Conference on Computer Vision vol. 2, 1033–1040.","short":"J. Kim, V. Kolmogorov, R. Zabih, in:, IEEE, 2003, pp. 1033–1040.","chicago":"Kim, Junhwan, Vladimir Kolmogorov, and Ramin Zabih. “Visual Correspondence Using Energy Minimization and Mutual Information,” 2:1033–40. IEEE, 2003. <a href=\"https://doi.org/10.1109/ICCV.2003.1238463\">https://doi.org/10.1109/ICCV.2003.1238463</a>."},"status":"public","month":"09","conference":{"name":"ICCV: International Conference on Computer Vision"},"date_created":"2018-12-11T12:01:49Z","publist_id":"3510","intvolume":"         2","publisher":"IEEE","volume":2,"page":"1033 - 1040","date_published":"2003-09-30T00:00:00Z"},{"publisher":"Elsevier","date_published":"2003-12-01T00:00:00Z","page":"757 - 771","volume":67,"issue":"4","month":"12","date_created":"2018-12-11T12:02:01Z","status":"public","intvolume":"        67","publist_id":"3472","type":"journal_article","date_updated":"2021-01-12T07:41:49Z","year":"2003","day":"01","citation":{"ama":"Pietrzak KZ. On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems. <i>Journal of Computer and System Sciences</i>. 2003;67(4):757-771. doi:<a href=\"https://doi.org/10.1016/S0022-0000(03)00078-3\">10.1016/S0022-0000(03)00078-3</a>","ieee":"K. Z. Pietrzak, “On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems,” <i>Journal of Computer and System Sciences</i>, vol. 67, no. 4. Elsevier, pp. 757–771, 2003.","short":"K.Z. Pietrzak, Journal of Computer and System Sciences 67 (2003) 757–771.","chicago":"Pietrzak, Krzysztof Z. “On the Parameterized Complexity of the Fixed Alphabet Shortest Common Supersequence and Longest Common Subsequence Problems.” <i>Journal of Computer and System Sciences</i>. Elsevier, 2003. <a href=\"https://doi.org/10.1016/S0022-0000(03)00078-3\">https://doi.org/10.1016/S0022-0000(03)00078-3</a>.","ista":"Pietrzak KZ. 2003. On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems. Journal of Computer and System Sciences. 67(4), 757–771.","mla":"Pietrzak, Krzysztof Z. “On the Parameterized Complexity of the Fixed Alphabet Shortest Common Supersequence and Longest Common Subsequence Problems.” <i>Journal of Computer and System Sciences</i>, vol. 67, no. 4, Elsevier, 2003, pp. 757–71, doi:<a href=\"https://doi.org/10.1016/S0022-0000(03)00078-3\">10.1016/S0022-0000(03)00078-3</a>.","apa":"Pietrzak, K. Z. (2003). On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems. <i>Journal of Computer and System Sciences</i>. Elsevier. <a href=\"https://doi.org/10.1016/S0022-0000(03)00078-3\">https://doi.org/10.1016/S0022-0000(03)00078-3</a>"},"author":[{"id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654","full_name":"Krzysztof Pietrzak","first_name":"Krzysztof Z","last_name":"Pietrzak"}],"extern":1,"quality_controlled":0,"abstract":[{"text":"We show that the fixed alphabet shortest common supersequence (SCS) and the fixed alphabet longest common subsequence (LCS) problems parameterized in the number of strings are W[1]-hard. Unless W[1]=FPT, this rules out the existence of algorithms with time complexity of O(f(k)nα) for those problems. Here n is the size of the problem instance, α is constant, k is the number of strings and f is any function of k. The fixed alphabet version of the LCS problem is of particular interest considering the importance of sequence comparison (e.g. multiple sequence alignment) in the fixed length alphabet world of DNA and protein sequences.","lang":"eng"}],"publication_status":"published","title":"On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems","publication":"Journal of Computer and System Sciences","_id":"3209","doi":"10.1016/S0022-0000(03)00078-3"},{"publication_status":"published","abstract":[{"lang":"eng","text":"Luby and Rackoff showed how to construct a (super-)pseudo-random permutation {0,1}2n→ {0,1}2n from some number r of pseudo-random functions {0,1}n → {0,1}n. Their construction, motivated by DES, consists of a cascade of r Feistel permutations. A Feistel permutation 1for a pseudo-random function f is defined as (L, R) → (R,L ⊕ f (R)), where L and R are the left and right part of the input and ⊕ denotes bitwise XOR or, in this paper, any other group operation on {0,1}n. The only non-trivial step of the security proof consists of proving that the cascade of r Feistel permutations with independent uniform random functions {0,1}n → {0,1}n, denoted Ψ2nr is indistinguishable from a uniform random permutation {0,1}2n → {0,1}2n by any computationally unbounded adaptive distinguisher making at most O(2cn) combined chosen plaintext/ciphertext queries for any c &lt; α, where a is a security parameter. Luby and Rackoff proved α = 1/2 for r = 4. A natural problem, proposed by Pieprzyk is to improve on α for larger r. The best known result, α = 3/4 for r = 6, is due to Patarin. In this paper we prove a = 1 -O(1/r), i.e., the trivial upper bound α = 1 can be approached. The proof uses some new techniques that can be of independent interest. "}],"title":"The security of many round Luby Rackoff pseudo random permutations","doi":"10.1007/3-540-39200-9_34","_id":"3210","type":"conference","date_updated":"2021-01-12T07:41:49Z","day":"04","year":"2003","citation":{"mla":"Maurer, Ueli, and Krzysztof Z. Pietrzak. <i>The Security of Many Round Luby Rackoff Pseudo Random Permutations</i>. Vol. 2656, Springer, 2003, pp. 544–61, doi:<a href=\"https://doi.org/10.1007/3-540-39200-9_34\">10.1007/3-540-39200-9_34</a>.","apa":"Maurer, U., &#38; Pietrzak, K. Z. (2003). The security of many round Luby Rackoff pseudo random permutations (Vol. 2656, pp. 544–561). Presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Springer. <a href=\"https://doi.org/10.1007/3-540-39200-9_34\">https://doi.org/10.1007/3-540-39200-9_34</a>","ista":"Maurer U, Pietrzak KZ. 2003. The security of many round Luby Rackoff pseudo random permutations. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 2656, 544–561.","chicago":"Maurer, Ueli, and Krzysztof Z Pietrzak. “The Security of Many Round Luby Rackoff Pseudo Random Permutations,” 2656:544–61. Springer, 2003. <a href=\"https://doi.org/10.1007/3-540-39200-9_34\">https://doi.org/10.1007/3-540-39200-9_34</a>.","short":"U. Maurer, K.Z. Pietrzak, in:, Springer, 2003, pp. 544–561.","ieee":"U. Maurer and K. Z. Pietrzak, “The security of many round Luby Rackoff pseudo random permutations,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, 2003, vol. 2656, pp. 544–561.","ama":"Maurer U, Pietrzak KZ. The security of many round Luby Rackoff pseudo random permutations. In: Vol 2656. Springer; 2003:544-561. doi:<a href=\"https://doi.org/10.1007/3-540-39200-9_34\">10.1007/3-540-39200-9_34</a>"},"author":[{"full_name":"Maurer, Ueli M","first_name":"Ueli","last_name":"Maurer"},{"last_name":"Pietrzak","first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654","full_name":"Krzysztof Pietrzak"}],"quality_controlled":0,"extern":1,"date_created":"2018-12-11T12:02:02Z","conference":{"name":"EUROCRYPT: Theory and Applications of Cryptographic Techniques"},"month":"06","status":"public","intvolume":"      2656","alternative_title":["LNCS"],"publist_id":"3473","publisher":"Springer","date_published":"2003-06-04T00:00:00Z","page":"544 - 561","volume":2656},{"citation":{"mla":"Bollenbach, Mark Tobias, et al. <i>3D Supernova Collapse Calculations</i>. Vol. 166, Springer, 2003, pp. 277–88, doi:<a href=\"https://doi.org/10.1007/978-1-4020-2705-5_21\">10.1007/978-1-4020-2705-5_21</a>.","apa":"Bollenbach, M. T., Strother, T., &#38; Bauer, W. (2003). 3D supernova collapse calculations (Vol. 166, pp. 277–288). Presented at the NATO ASI on Structure and Dynamics of Elementary Matter, Springer. <a href=\"https://doi.org/10.1007/978-1-4020-2705-5_21\">https://doi.org/10.1007/978-1-4020-2705-5_21</a>","short":"M.T. Bollenbach, T. Strother, W. Bauer, in:, Springer, 2003, pp. 277–288.","chicago":"Bollenbach, Mark Tobias, T. Strother, and Wolfgang Bauer. “3D Supernova Collapse Calculations,” 166:277–88. Springer, 2003. <a href=\"https://doi.org/10.1007/978-1-4020-2705-5_21\">https://doi.org/10.1007/978-1-4020-2705-5_21</a>.","ista":"Bollenbach MT, Strother T, Bauer W. 2003. 3D supernova collapse calculations. NATO ASI on Structure and Dynamics of Elementary Matter, Nato Science Series II, vol. 166, 277–288.","ieee":"M. T. Bollenbach, T. Strother, and W. Bauer, “3D supernova collapse calculations,” presented at the NATO ASI on Structure and Dynamics of Elementary Matter, 2003, vol. 166, pp. 277–288.","ama":"Bollenbach MT, Strother T, Bauer W. 3D supernova collapse calculations. In: Vol 166. Springer; 2003:277-288. doi:<a href=\"https://doi.org/10.1007/978-1-4020-2705-5_21\">10.1007/978-1-4020-2705-5_21</a>"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","author":[{"orcid":"0000-0003-4398-476X","full_name":"Bollenbach, Mark Tobias","id":"3E6DB97A-F248-11E8-B48F-1D18A9856A87","last_name":"Bollenbach","first_name":"Mark Tobias"},{"last_name":"Strother","first_name":"T.","full_name":"Strother, T."},{"full_name":"Bauer, Wolfgang","first_name":"Wolfgang","last_name":"Bauer"}],"extern":"1","oa_version":"None","type":"conference","date_updated":"2021-01-12T07:43:23Z","year":"2003","day":"01","title":"3D supernova collapse calculations","_id":"3425","doi":"10.1007/978-1-4020-2705-5_21","language":[{"iso":"eng"}],"publication_status":"published","date_published":"2003-01-01T00:00:00Z","page":"277 - 288","volume":166,"publisher":"Springer","alternative_title":["Nato Science Series II"],"intvolume":"       166","publist_id":"2976","conference":{"name":"NATO ASI on Structure and Dynamics of Elementary Matter"},"month":"01","date_created":"2018-12-11T12:03:16Z","status":"public"},{"year":"2003","day":"01","type":"book_chapter","date_updated":"2021-01-12T07:43:35Z","extern":1,"author":[{"id":"353C1B58-F248-11E8-B48F-1D18A9856A87","full_name":"Peter Jonas","orcid":"0000-0001-5001-4804","first_name":"Peter M","last_name":"Jonas"},{"full_name":"Unsicker, Klaus","last_name":"Unsicker","first_name":"Klaus"}],"quality_controlled":0,"citation":{"ama":"Jonas PM, Unsicker K. Molekulare und zelluläre Grundlagen des Nervensystems. In: Schmidt R, ed. <i>Lehrbuch Vorklinik</i>. Vol B. Deutscher Ärzte Verlag; 2003:3-26.","ieee":"P. M. Jonas and K. Unsicker, “Molekulare und zelluläre Grundlagen des Nervensystems.,” in <i>Lehrbuch Vorklinik</i>, vol. B, R. Schmidt, Ed. Deutscher Ärzte Verlag, 2003, pp. 3–26.","ista":"Jonas PM, Unsicker K. 2003.Molekulare und zelluläre Grundlagen des Nervensystems. In: Lehrbuch Vorklinik. vol. B, 3–26.","chicago":"Jonas, Peter M, and Klaus Unsicker. “Molekulare Und Zelluläre Grundlagen Des Nervensystems.” In <i>Lehrbuch Vorklinik</i>, edited by R. Schmidt, B:3–26. Deutscher Ärzte Verlag, 2003.","short":"P.M. Jonas, K. Unsicker, in:, R. Schmidt (Ed.), Lehrbuch Vorklinik, Deutscher Ärzte Verlag, 2003, pp. 3–26.","apa":"Jonas, P. M., &#38; Unsicker, K. (2003). Molekulare und zelluläre Grundlagen des Nervensystems. In R. Schmidt (Ed.), <i>Lehrbuch Vorklinik</i> (Vol. B, pp. 3–26). Deutscher Ärzte Verlag.","mla":"Jonas, Peter M., and Klaus Unsicker. “Molekulare Und Zelluläre Grundlagen Des Nervensystems.” <i>Lehrbuch Vorklinik</i>, edited by R. Schmidt, vol. B, Deutscher Ärzte Verlag, 2003, pp. 3–26."},"publication_status":"published","_id":"3458","title":"Molekulare und zelluläre Grundlagen des Nervensystems.","publication":"Lehrbuch Vorklinik","editor":[{"full_name":"Schmidt, R. F.","first_name":"R.","last_name":"Schmidt"}],"publisher":"Deutscher Ärzte Verlag","volume":"B","page":"3 - 26","date_published":"2003-01-01T00:00:00Z","status":"public","month":"01","date_created":"2018-12-11T12:03:26Z","publist_id":"2929"},{"publisher":"Nature Publishing Group","date_published":"2003-07-31T00:00:00Z","issue":"6948","page":"552 - 556","volume":424,"month":"07","date_created":"2018-12-11T12:03:47Z","status":"public","intvolume":"       424","publist_id":"2859","date_updated":"2021-01-12T07:44:04Z","type":"journal_article","year":"2003","day":"31","citation":{"apa":"Harris, K., Csicsvari, J. L., Hirase, H., Dragoi, G., &#38; Buzsáki, G. (2003). Organization of cell assemblies in the hippocampus. <i>Nature</i>. Nature Publishing Group. <a href=\"https://doi.org/0.1038/nature01834\">https://doi.org/0.1038/nature01834</a>","mla":"Harris, Kenneth, et al. “Organization of Cell Assemblies in the Hippocampus.” <i>Nature</i>, vol. 424, no. 6948, Nature Publishing Group, 2003, pp. 552–56, doi:<a href=\"https://doi.org/0.1038/nature01834\">0.1038/nature01834</a>.","ista":"Harris K, Csicsvari JL, Hirase H, Dragoi G, Buzsáki G. 2003. Organization of cell assemblies in the hippocampus. Nature. 424(6948), 552–556.","chicago":"Harris, Kenneth, Jozsef L Csicsvari, Hajima Hirase, George Dragoi, and György Buzsáki. “Organization of Cell Assemblies in the Hippocampus.” <i>Nature</i>. Nature Publishing Group, 2003. <a href=\"https://doi.org/0.1038/nature01834\">https://doi.org/0.1038/nature01834</a>.","short":"K. Harris, J.L. Csicsvari, H. Hirase, G. Dragoi, G. Buzsáki, Nature 424 (2003) 552–556.","ieee":"K. Harris, J. L. Csicsvari, H. Hirase, G. Dragoi, and G. Buzsáki, “Organization of cell assemblies in the hippocampus,” <i>Nature</i>, vol. 424, no. 6948. Nature Publishing Group, pp. 552–556, 2003.","ama":"Harris K, Csicsvari JL, Hirase H, Dragoi G, Buzsáki G. Organization of cell assemblies in the hippocampus. <i>Nature</i>. 2003;424(6948):552-556. doi:<a href=\"https://doi.org/0.1038/nature01834\">0.1038/nature01834</a>"},"quality_controlled":0,"author":[{"last_name":"Harris","first_name":"Kenneth","full_name":"Harris, Kenneth D"},{"first_name":"Jozsef L","last_name":"Csicsvari","orcid":"0000-0002-5193-4036","full_name":"Jozsef Csicsvari","id":"3FA14672-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Hirase","first_name":"Hajima","full_name":"Hirase, Hajima"},{"last_name":"Dragoi","first_name":"George","full_name":"Dragoi, George"},{"full_name":"Buzsáki, György","last_name":"Buzsáki","first_name":"György"}],"extern":1,"abstract":[{"text":"Neurons can produce action potentials with high temporal precision(1). A fundamental issue is whether, and how, this capability is used in information processing. According to the `cell assembly' hypothesis, transient synchrony of anatomically distributed groups of neurons underlies processing of both external sensory input and internal cognitive mechanisms(2-4). Accordingly, neuron populations should be arranged into groups whose synchrony exceeds that predicted by common modulation by sensory input. Here we find that the spike times of hippocampal pyramidal cells can be predicted more accurately by using the spike times of simultaneously recorded neurons in addition to the animals location in space. This improvement remained when the spatial prediction was refined with a spatially dependent theta phase modulation(5-8). The time window in which spike times are best predicted from simultaneous peer activity is 10-30 ms, suggesting that cell assemblies are synchronized at this timescale. Because this temporal window matches the membrane time constant of pyramidal neurons(9), the period of the hippocampal gamma oscillation(10) and the time window for synaptic plasticity(11), we propose that cooperative activity at this timescale is optimal for information transmission and storage in cortical circuits.","lang":"eng"}],"publication_status":"published","publication":"Nature","title":"Organization of cell assemblies in the hippocampus","_id":"3526","doi":"0.1038/nature01834"},{"citation":{"chicago":"Csicsvari, Jozsef L, Brian Jamieson, Kensall Wise, and György Buzsáki. “Mechanisms of Gamma Oscillations in the Hippocampus of the Behaving Rat.” <i>Neuron</i>. Elsevier, 2003. <a href=\"https://doi.org/10.1016/S0896-6273(02)01169-8\">https://doi.org/10.1016/S0896-6273(02)01169-8</a>.","short":"J.L. Csicsvari, B. Jamieson, K. Wise, G. Buzsáki, Neuron 37 (2003) 311–322.","ista":"Csicsvari JL, Jamieson B, Wise K, Buzsáki G. 2003. Mechanisms of gamma oscillations in the hippocampus of the behaving rat. Neuron. 37(2), 311–322.","ieee":"J. L. Csicsvari, B. Jamieson, K. Wise, and G. Buzsáki, “Mechanisms of gamma oscillations in the hippocampus of the behaving rat,” <i>Neuron</i>, vol. 37, no. 2. Elsevier, pp. 311–322, 2003.","ama":"Csicsvari JL, Jamieson B, Wise K, Buzsáki G. Mechanisms of gamma oscillations in the hippocampus of the behaving rat. <i>Neuron</i>. 2003;37(2):311-322. doi:<a href=\"https://doi.org/10.1016/S0896-6273(02)01169-8\">10.1016/S0896-6273(02)01169-8</a>","apa":"Csicsvari, J. L., Jamieson, B., Wise, K., &#38; Buzsáki, G. (2003). Mechanisms of gamma oscillations in the hippocampus of the behaving rat. <i>Neuron</i>. Elsevier. <a href=\"https://doi.org/10.1016/S0896-6273(02)01169-8\">https://doi.org/10.1016/S0896-6273(02)01169-8</a>","mla":"Csicsvari, Jozsef L., et al. “Mechanisms of Gamma Oscillations in the Hippocampus of the Behaving Rat.” <i>Neuron</i>, vol. 37, no. 2, Elsevier, 2003, pp. 311–22, doi:<a href=\"https://doi.org/10.1016/S0896-6273(02)01169-8\">10.1016/S0896-6273(02)01169-8</a>."},"extern":1,"quality_controlled":0,"author":[{"first_name":"Jozsef L","last_name":"Csicsvari","id":"3FA14672-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5193-4036","full_name":"Jozsef Csicsvari"},{"last_name":"Jamieson","first_name":"Brian","full_name":"Jamieson, Brian G"},{"last_name":"Wise","first_name":"Kensall","full_name":"Wise, Kensall D"},{"full_name":"Buzsáki, György","first_name":"György","last_name":"Buzsáki"}],"type":"journal_article","date_updated":"2021-01-12T07:44:05Z","year":"2003","day":"01","publication":"Neuron","title":"Mechanisms of gamma oscillations in the hippocampus of the behaving rat","_id":"3528","doi":"10.1016/S0896-6273(02)01169-8","abstract":[{"text":"Gamma frequency oscillations (30-100 Hz) have been suggested to underlie various cognitive and motor functions. Here, we examine the generation of gamma oscillation currents in the hippocampus, using two-dimensional, 96-site silicon probes. Two gamma generators were identified, one in the dentate gyrus and another in the CA3-CA1 regions. The coupling strength between the two oscillators varied during both theta and nontheta states. Both pyramidal cells and interneurons were phase-locked to gamma waves. Anatomical connectivity, rather than physical distance, determined the coupling strength of the oscillating neurons. CA3 pyramidal neurons discharged CA3 and CA1 interneurons at latencies indicative of monosynaptic connections. Intrahippocampal gamma oscillation emerges in the CA3 recurrent system, which entrains the CA1 region via its interneurons.","lang":"eng"}],"publication_status":"published","date_published":"2003-01-01T00:00:00Z","page":"311 - 322","issue":"2","volume":37,"publisher":"Elsevier","intvolume":"        37","publist_id":"2857","month":"01","date_created":"2018-12-11T12:03:48Z","status":"public"},{"intvolume":"        90","publist_id":"2856","date_created":"2018-12-11T12:03:48Z","month":"08","status":"public","date_published":"2003-08-01T00:00:00Z","volume":90,"page":"1314 - 1323","issue":"2","publisher":"American Physiological Society","publication":"Journal of Neurophysiology","title":"Massively parallel recording of unit and local field potentials with silicon-based electrodes","doi":"10.1152/jn.00116.2003","_id":"3529","publication_status":"published","abstract":[{"lang":"eng","text":"Parallel recording of neuronal activity in the behaving animal is a prerequisite for our understanding of neuronal representation and storage of information. Here we describe the development of micro-machined silicon microelectrode arrays for unit and local field recordings. The two-dimensional probes with 96 or 64 recording sites provided high-density recording of unit and field activity with minimal tissue displacement or damage. The on-chip active circuit eliminated movement and other artifacts and greatly reduced the weight of the headgear. The precise geometry of the recording tips allowed for the estimation of the spatial location of the recorded neurons and for high-resolution estimation of extracellular current source density. Action potentials could be simultaneously recorded from the soma and dendrites of the same neurons. Silicon technology is a promising approach for high-density, high-resolution sampling of neuronal activity in both basic research and prosthetic devices."}],"citation":{"mla":"Csicsvari, Jozsef L., et al. “Massively Parallel Recording of Unit and Local Field Potentials with Silicon-Based Electrodes.” <i>Journal of Neurophysiology</i>, vol. 90, no. 2, American Physiological Society, 2003, pp. 1314–23, doi:<a href=\"https://doi.org/10.1152/jn.00116.2003\">10.1152/jn.00116.2003</a>.","apa":"Csicsvari, J. L., Henze, D., Jamieson, B., Harris, K., Sirota, A., Bartho, P., … Buzsáki, G. (2003). Massively parallel recording of unit and local field potentials with silicon-based electrodes. <i>Journal of Neurophysiology</i>. American Physiological Society. <a href=\"https://doi.org/10.1152/jn.00116.2003\">https://doi.org/10.1152/jn.00116.2003</a>","short":"J.L. Csicsvari, D. Henze, B. Jamieson, K. Harris, A. Sirota, P. Bartho, K. Wise, G. Buzsáki, Journal of Neurophysiology 90 (2003) 1314–1323.","chicago":"Csicsvari, Jozsef L, Darrell Henze, Brian Jamieson, Kenneth Harris, Anton Sirota, Peter Bartho, Kensall Wise, and György Buzsáki. “Massively Parallel Recording of Unit and Local Field Potentials with Silicon-Based Electrodes.” <i>Journal of Neurophysiology</i>. American Physiological Society, 2003. <a href=\"https://doi.org/10.1152/jn.00116.2003\">https://doi.org/10.1152/jn.00116.2003</a>.","ista":"Csicsvari JL, Henze D, Jamieson B, Harris K, Sirota A, Bartho P, Wise K, Buzsáki G. 2003. Massively parallel recording of unit and local field potentials with silicon-based electrodes. Journal of Neurophysiology. 90(2), 1314–1323.","ieee":"J. L. Csicsvari <i>et al.</i>, “Massively parallel recording of unit and local field potentials with silicon-based electrodes,” <i>Journal of Neurophysiology</i>, vol. 90, no. 2. American Physiological Society, pp. 1314–1323, 2003.","ama":"Csicsvari JL, Henze D, Jamieson B, et al. Massively parallel recording of unit and local field potentials with silicon-based electrodes. <i>Journal of Neurophysiology</i>. 2003;90(2):1314-1323. doi:<a href=\"https://doi.org/10.1152/jn.00116.2003\">10.1152/jn.00116.2003</a>"},"extern":1,"quality_controlled":0,"author":[{"full_name":"Jozsef Csicsvari","orcid":"0000-0002-5193-4036","id":"3FA14672-F248-11E8-B48F-1D18A9856A87","first_name":"Jozsef L","last_name":"Csicsvari"},{"full_name":"Henze, Darrell A","last_name":"Henze","first_name":"Darrell"},{"full_name":"Jamieson, Brian G","first_name":"Brian","last_name":"Jamieson"},{"last_name":"Harris","first_name":"Kenneth","full_name":"Harris, Kenneth D"},{"last_name":"Sirota","first_name":"Anton","full_name":"Sirota, Anton M"},{"last_name":"Bartho","first_name":"Peter","full_name":"Bartho, Peter"},{"full_name":"Wise, Kensall D","first_name":"Kensall","last_name":"Wise"},{"first_name":"György","last_name":"Buzsáki","full_name":"Buzsáki, György"}],"type":"journal_article","date_updated":"2021-01-12T07:44:05Z","day":"01","year":"2003"},{"date_updated":"2021-01-12T07:44:09Z","type":"journal_article","day":"15","year":"2003","citation":{"apa":"Buzsáki, G., Buhl, D., Harris, K., Csicsvari, J. L., Czéh, B., &#38; Morozov, A. (2003). Hippocampal network patterns of activity in the mouse. <i>Neuroscience</i>. Elsevier. <a href=\"https://doi.org/10.1016/S0306-4522(02)00669-3\">https://doi.org/10.1016/S0306-4522(02)00669-3</a>","mla":"Buzsáki, György, et al. “Hippocampal Network Patterns of Activity in the Mouse.” <i>Neuroscience</i>, vol. 116, no. 1, Elsevier, 2003, pp. 201–11, doi:<a href=\"https://doi.org/10.1016/S0306-4522(02)00669-3\">10.1016/S0306-4522(02)00669-3</a>.","ista":"Buzsáki G, Buhl D, Harris K, Csicsvari JL, Czéh B, Morozov A. 2003. Hippocampal network patterns of activity in the mouse. Neuroscience. 116(1), 201–211.","chicago":"Buzsáki, György, Derek Buhl, Kenneth Harris, Jozsef L Csicsvari, Boldizsár Czéh, and Alexei Morozov. “Hippocampal Network Patterns of Activity in the Mouse.” <i>Neuroscience</i>. Elsevier, 2003. <a href=\"https://doi.org/10.1016/S0306-4522(02)00669-3\">https://doi.org/10.1016/S0306-4522(02)00669-3</a>.","short":"G. Buzsáki, D. Buhl, K. Harris, J.L. Csicsvari, B. Czéh, A. Morozov, Neuroscience 116 (2003) 201–211.","ieee":"G. Buzsáki, D. Buhl, K. Harris, J. L. Csicsvari, B. Czéh, and A. Morozov, “Hippocampal network patterns of activity in the mouse,” <i>Neuroscience</i>, vol. 116, no. 1. Elsevier, pp. 201–211, 2003.","ama":"Buzsáki G, Buhl D, Harris K, Csicsvari JL, Czéh B, Morozov A. Hippocampal network patterns of activity in the mouse. <i>Neuroscience</i>. 2003;116(1):201-211. doi:<a href=\"https://doi.org/10.1016/S0306-4522(02)00669-3\">10.1016/S0306-4522(02)00669-3</a>"},"quality_controlled":0,"extern":1,"author":[{"last_name":"Buzsáki","first_name":"György","full_name":"Buzsáki, György"},{"full_name":"Buhl, Derek L","last_name":"Buhl","first_name":"Derek"},{"full_name":"Harris, Kenneth D","first_name":"Kenneth","last_name":"Harris"},{"orcid":"0000-0002-5193-4036","full_name":"Jozsef Csicsvari","id":"3FA14672-F248-11E8-B48F-1D18A9856A87","first_name":"Jozsef L","last_name":"Csicsvari"},{"first_name":"Boldizsár","last_name":"Czéh","full_name":"Czéh, Boldizsár"},{"first_name":"Alexei","last_name":"Morozov","full_name":"Morozov, Alexei"}],"publication_status":"published","abstract":[{"lang":"eng","text":"Genetic engineering of the mouse brain allows investigators to address novel hypotheses in vivo. Because of the paucity of information on the network patterns of the mouse hippocampus, we investigated the electrical patterns in the behaving animal using multisite silicon probes and wire tetrodes. Theta (6-9 Hz) and gamma (40-100 Hz) oscillations were present during exploration and rapid eye movement sleep. Gamma power and theta power were comodulated and gamma power varied as a function of the theta cycle. Pyramidal cells and putative interneurons were phase-locked to theta oscillations. During immobility, consummatory behaviors and slow-wave sleep, sharp waves were present in cornu ammonis region CA1 of the hippocampus stratum radiatum associated with 140-200-Hz “ripples” in the pyramidal cell layer and population burst of CA1 neurons. In the hilus, large-amplitude “dentate spikes” occurred in association with increased discharge of hilar neurons. The amplitude of field patterns was larger in the mouse than in the rat, likely reflecting the higher neuron density in a smaller brain. We suggest that the main hippocampal network patterns are mediated by similar pathways and mechanisms in mouse and rat. "}],"publication":"Neuroscience","title":"Hippocampal network patterns of activity in the mouse","doi":"10.1016/S0306-4522(02)00669-3","_id":"3536","publisher":"Elsevier","date_published":"2003-01-15T00:00:00Z","page":"201 - 211","issue":"1","volume":116,"date_created":"2018-12-11T12:03:50Z","month":"01","status":"public","intvolume":"       116","publist_id":"2849"},{"_id":"3543","doi":"10.1073/pnas.0437938100","title":"Communication between neocortex and hippocampus during sleep in rodents","publication":"PNAS","abstract":[{"lang":"eng","text":"Both neocortical and hippocampal networks organize the firing patterns of their neurons by prominent oscillations during sleep, but the functional role of these rhythms is not well understood. Here, we show a robust correlation of neuronal discharges between the somatosensory cortex and hippocampus on both slow and fine time scales in the mouse and rat. Neuronal bursts in deep cortical layers, associated with sleep spindles and delta waves/slow rhythm, effectively triggered hippocampal discharges related to fast (ripple) oscillations. We hypothesize that oscillation-mediated temporal links coordinate specific information transfer between neocortical and hippocampal cell assemblies. Such a neocortical-hippocampal interplay may be important for memory consolidation."}],"publication_status":"published","quality_controlled":0,"author":[{"full_name":"Sirota, Anton M","last_name":"Sirota","first_name":"Anton"},{"full_name":"Jozsef Csicsvari","orcid":"0000-0002-5193-4036","id":"3FA14672-F248-11E8-B48F-1D18A9856A87","last_name":"Csicsvari","first_name":"Jozsef L"},{"first_name":"Derek","last_name":"Buhl","full_name":"Buhl, Derek L"},{"first_name":"György","last_name":"Buzsáki","full_name":"Buzsáki, György"}],"extern":1,"citation":{"ista":"Sirota A, Csicsvari JL, Buhl D, Buzsáki G. 2003. Communication between neocortex and hippocampus during sleep in rodents. PNAS. 100(4), 2065–2069.","chicago":"Sirota, Anton, Jozsef L Csicsvari, Derek Buhl, and György Buzsáki. “Communication between Neocortex and Hippocampus during Sleep in Rodents.” <i>PNAS</i>. National Academy of Sciences, 2003. <a href=\"https://doi.org/10.1073/pnas.0437938100\">https://doi.org/10.1073/pnas.0437938100</a>.","short":"A. Sirota, J.L. Csicsvari, D. Buhl, G. Buzsáki, PNAS 100 (2003) 2065–2069.","ieee":"A. Sirota, J. L. Csicsvari, D. Buhl, and G. Buzsáki, “Communication between neocortex and hippocampus during sleep in rodents,” <i>PNAS</i>, vol. 100, no. 4. National Academy of Sciences, pp. 2065–2069, 2003.","ama":"Sirota A, Csicsvari JL, Buhl D, Buzsáki G. Communication between neocortex and hippocampus during sleep in rodents. <i>PNAS</i>. 2003;100(4):2065-2069. doi:<a href=\"https://doi.org/10.1073/pnas.0437938100\">10.1073/pnas.0437938100</a>","mla":"Sirota, Anton, et al. “Communication between Neocortex and Hippocampus during Sleep in Rodents.” <i>PNAS</i>, vol. 100, no. 4, National Academy of Sciences, 2003, pp. 2065–69, doi:<a href=\"https://doi.org/10.1073/pnas.0437938100\">10.1073/pnas.0437938100</a>.","apa":"Sirota, A., Csicsvari, J. L., Buhl, D., &#38; Buzsáki, G. (2003). Communication between neocortex and hippocampus during sleep in rodents. <i>PNAS</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.0437938100\">https://doi.org/10.1073/pnas.0437938100</a>"},"year":"2003","day":"18","type":"journal_article","date_updated":"2021-01-12T07:44:12Z","publist_id":"2841","intvolume":"       100","status":"public","month":"02","date_created":"2018-12-11T12:03:53Z","page":"2065 - 2069","volume":100,"issue":"4","date_published":"2003-02-18T00:00:00Z","publisher":"National Academy of Sciences"},{"doi":"10.1145/777792.777846","_id":"3556","title":"Morse-Smale complexes for piecewise linear 3-manifolds","publication_status":"published","abstract":[{"lang":"eng","text":"We define the Morse-Smale complex of a Morse function over a 3-manifold as the overlay of the descending and as- cending manifolds of all critical points. In the generic case, its 3-dimensional cells are shaped like crystals and are sepa- rated by quadrangular faces. In this paper, we give a combi- natorial algorithm for constructing such complexes for piece- wise linear data."}],"extern":1,"author":[{"full_name":"Herbert Edelsbrunner","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","first_name":"Herbert"},{"first_name":"John","last_name":"Harer","full_name":"Harer, John"},{"full_name":"Natarajan, Vijay","first_name":"Vijay","last_name":"Natarajan"},{"last_name":"Pascucci","first_name":"Valerio","full_name":"Pascucci, Valerio"}],"quality_controlled":0,"citation":{"mla":"Edelsbrunner, Herbert, et al. <i>Morse-Smale Complexes for Piecewise Linear 3-Manifolds</i>. ACM, 2003, pp. 361–70, doi:<a href=\"https://doi.org/10.1145/777792.777846\">10.1145/777792.777846</a>.","apa":"Edelsbrunner, H., Harer, J., Natarajan, V., &#38; Pascucci, V. (2003). Morse-Smale complexes for piecewise linear 3-manifolds (pp. 361–370). Presented at the SCG: Symposium on Computational Geometry, ACM. <a href=\"https://doi.org/10.1145/777792.777846\">https://doi.org/10.1145/777792.777846</a>","ieee":"H. Edelsbrunner, J. Harer, V. Natarajan, and V. Pascucci, “Morse-Smale complexes for piecewise linear 3-manifolds,” presented at the SCG: Symposium on Computational Geometry, 2003, pp. 361–370.","ama":"Edelsbrunner H, Harer J, Natarajan V, Pascucci V. Morse-Smale complexes for piecewise linear 3-manifolds. In: ACM; 2003:361-370. doi:<a href=\"https://doi.org/10.1145/777792.777846\">10.1145/777792.777846</a>","ista":"Edelsbrunner H, Harer J, Natarajan V, Pascucci V. 2003. Morse-Smale complexes for piecewise linear 3-manifolds. SCG: Symposium on Computational Geometry, 361–370.","short":"H. Edelsbrunner, J. Harer, V. Natarajan, V. Pascucci, in:, ACM, 2003, pp. 361–370.","chicago":"Edelsbrunner, Herbert, John Harer, Vijay Natarajan, and Valerio Pascucci. “Morse-Smale Complexes for Piecewise Linear 3-Manifolds,” 361–70. ACM, 2003. <a href=\"https://doi.org/10.1145/777792.777846\">https://doi.org/10.1145/777792.777846</a>."},"main_file_link":[{"url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.14.9592","open_access":"0"}],"day":"01","year":"2003","type":"conference","date_updated":"2021-01-12T07:44:17Z","publist_id":"2829","status":"public","date_created":"2018-12-11T12:03:57Z","conference":{"name":"SCG: Symposium on Computational Geometry"},"month":"06","page":"361 - 370","date_published":"2003-06-01T00:00:00Z","publisher":"ACM"},{"status":"public","month":"06","date_created":"2018-12-11T12:04:02Z","publist_id":"2812","publisher":"Springer","page":"379 - 404","date_published":"2003-06-23T00:00:00Z","abstract":[{"lang":"eng","text":"Given a finite point set in R, the surface reconstruction problem asks for a surface that passes through many but not necessarily all points. We describe an unambigu- ous definition of such a surface in geometric and topological terms, and sketch a fast algorithm for constructing it. Our solution overcomes past limitations to special point distributions and heuristic design decisions."}],"publication_status":"published","_id":"3573","doi":"10.1007/978-3-642-55566-4_17","publication":"Discrete & Computational Geometry","title":"Surface reconstruction by wrapping finite sets in space","year":"2003","day":"23","date_updated":"2021-01-12T07:44:24Z","type":"book_chapter","extern":1,"quality_controlled":0,"author":[{"first_name":"Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","full_name":"Herbert Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"}],"main_file_link":[{"open_access":"0","url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.129.3633"}],"citation":{"mla":"Edelsbrunner, Herbert. “Surface Reconstruction by Wrapping Finite Sets in Space.” <i>Discrete &#38; Computational Geometry</i>, Springer, 2003, pp. 379–404, doi:<a href=\"https://doi.org/10.1007/978-3-642-55566-4_17\">10.1007/978-3-642-55566-4_17</a>.","apa":"Edelsbrunner, H. (2003). Surface reconstruction by wrapping finite sets in space. In <i>Discrete &#38; Computational Geometry</i> (pp. 379–404). Springer. <a href=\"https://doi.org/10.1007/978-3-642-55566-4_17\">https://doi.org/10.1007/978-3-642-55566-4_17</a>","ieee":"H. Edelsbrunner, “Surface reconstruction by wrapping finite sets in space,” in <i>Discrete &#38; Computational Geometry</i>, Springer, 2003, pp. 379–404.","ama":"Edelsbrunner H. Surface reconstruction by wrapping finite sets in space. In: <i>Discrete &#38; Computational Geometry</i>. Springer; 2003:379-404. doi:<a href=\"https://doi.org/10.1007/978-3-642-55566-4_17\">10.1007/978-3-642-55566-4_17</a>","chicago":"Edelsbrunner, Herbert. “Surface Reconstruction by Wrapping Finite Sets in Space.” In <i>Discrete &#38; Computational Geometry</i>, 379–404. Springer, 2003. <a href=\"https://doi.org/10.1007/978-3-642-55566-4_17\">https://doi.org/10.1007/978-3-642-55566-4_17</a>.","short":"H. Edelsbrunner, in:, Discrete &#38; Computational Geometry, Springer, 2003, pp. 379–404.","ista":"Edelsbrunner H. 2003.Surface reconstruction by wrapping finite sets in space. In: Discrete &#38; Computational Geometry. , 379–404."}},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","first_name":"Herbert"},{"full_name":"Zomorodian, Afra","first_name":"Afra","last_name":"Zomorodian"}],"quality_controlled":"1","extern":"1","citation":{"short":"H. Edelsbrunner, A. Zomorodian, Homology, Homotopy and Applications 5 (2003) 19–37.","chicago":"Edelsbrunner, Herbert, and Afra Zomorodian. “Computing Linking Numbers of a Filtration.” <i>Homology, Homotopy and Applications</i>. International Press, 2003.","ista":"Edelsbrunner H, Zomorodian A. 2003. Computing linking numbers of a filtration. Homology, Homotopy and Applications. 5(2), 19–37.","ieee":"H. Edelsbrunner and A. Zomorodian, “Computing linking numbers of a filtration,” <i>Homology, Homotopy and Applications</i>, vol. 5, no. 2. International Press, pp. 19–37, 2003.","ama":"Edelsbrunner H, Zomorodian A. Computing linking numbers of a filtration. <i>Homology, Homotopy and Applications</i>. 2003;5(2):19-37.","mla":"Edelsbrunner, Herbert, and Afra Zomorodian. “Computing Linking Numbers of a Filtration.” <i>Homology, Homotopy and Applications</i>, vol. 5, no. 2, International Press, 2003, pp. 19–37.","apa":"Edelsbrunner, H., &#38; Zomorodian, A. (2003). Computing linking numbers of a filtration. <i>Homology, Homotopy and Applications</i>. International Press."},"main_file_link":[{"url":"http://projecteuclid.org/euclid.hha/1088453320"}],"day":"22","year":"2003","date_updated":"2021-01-12T07:44:28Z","type":"journal_article","oa_version":"None","language":[{"iso":"eng"}],"_id":"3584","title":"Computing linking numbers of a filtration","publication":"Homology, Homotopy and Applications","publication_status":"published","abstract":[{"text":"We develop fast algorithms for computing the linking number of a simplicial complex within a filtration.We give experimental results in applying our work toward the detection of non-trivial tangling in biomolecules, modeled as alpha complexes.","lang":"eng"}],"issue":"2","page":"19 - 37","volume":5,"date_published":"2003-04-22T00:00:00Z","publisher":"International Press","publist_id":"2801","intvolume":"         5","status":"public","date_created":"2018-12-11T12:04:05Z","month":"04"},{"publisher":"Springer","page":"205 - 232","volume":30,"issue":"2","date_published":"2003-02-01T00:00:00Z","status":"public","month":"02","date_created":"2018-12-11T12:04:08Z","publist_id":"2790","intvolume":"        30","year":"2003","day":"01","type":"journal_article","date_updated":"2021-01-12T07:44:31Z","extern":1,"quality_controlled":0,"author":[{"orcid":"0000-0002-4561-241X","full_name":"Krishnendu Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"},{"first_name":"Pallab","last_name":"Dasgupta","full_name":"Dasgupta, Pallab"},{"full_name":"Chakrabarti, Partha P","first_name":"Partha","last_name":"Chakrabarti"}],"citation":{"chicago":"Chatterjee, Krishnendu, Pallab Dasgupta, and Partha Chakrabarti. “A Branching Time Temporal Framework for Quantitative Reasoning.” <i>Journal of Automated Reasoning</i>. Springer, 2003. <a href=\"https://doi.org/10.1023/A:1023217515688\">https://doi.org/10.1023/A:1023217515688</a>.","short":"K. Chatterjee, P. Dasgupta, P. Chakrabarti, Journal of Automated Reasoning 30 (2003) 205–232.","ista":"Chatterjee K, Dasgupta P, Chakrabarti P. 2003. A branching time temporal framework for quantitative reasoning. Journal of Automated Reasoning. 30(2), 205–232.","ieee":"K. Chatterjee, P. Dasgupta, and P. Chakrabarti, “A branching time temporal framework for quantitative reasoning,” <i>Journal of Automated Reasoning</i>, vol. 30, no. 2. Springer, pp. 205–232, 2003.","ama":"Chatterjee K, Dasgupta P, Chakrabarti P. A branching time temporal framework for quantitative reasoning. <i>Journal of Automated Reasoning</i>. 2003;30(2):205-232. doi:<a href=\"https://doi.org/10.1023/A:1023217515688\">10.1023/A:1023217515688</a>","apa":"Chatterjee, K., Dasgupta, P., &#38; Chakrabarti, P. (2003). A branching time temporal framework for quantitative reasoning. <i>Journal of Automated Reasoning</i>. Springer. <a href=\"https://doi.org/10.1023/A:1023217515688\">https://doi.org/10.1023/A:1023217515688</a>","mla":"Chatterjee, Krishnendu, et al. “A Branching Time Temporal Framework for Quantitative Reasoning.” <i>Journal of Automated Reasoning</i>, vol. 30, no. 2, Springer, 2003, pp. 205–32, doi:<a href=\"https://doi.org/10.1023/A:1023217515688\">10.1023/A:1023217515688</a>."},"abstract":[{"text":"Temporal logics such as Computation Tree Logic (CTL) and Linear Temporal Logic (LTL) have become popular for specifying temporal properties over a wide variety of planning and verification problems. In this paper we work towards building a generalized framework for automated reasoning based on temporal logics. We present a powerful extension of CTL with first-order quantification over the set of reachable states for reasoning about extremal properties of weighted labeled transition systems in general. The proposed logic, which we call Weighted Quantified Computation Tree Logic (WQCTL), captures the essential elements common to the domain of planning and verification problems and can thereby be used as an effective specification language in both domains. We show that in spite of the rich, expressive power of the logic, we are able to evaluate WQCTL formulas in time polynomial in the size of the state space times the length of the formula. Wepresent experimental results on the WQCTL verifier.","lang":"eng"}],"publication_status":"published","_id":"3593","doi":"10.1023/A:1023217515688","title":"A branching time temporal framework for quantitative reasoning","publication":"Journal of Automated Reasoning"},{"doi":"10.1046/j.1365-294X.2003.01867.x","_id":"3618","publication":"Molecular Ecology","title":"A new approach to detecting mixed families","publication_status":"published","abstract":[{"text":"There are several analyses in evolutionary ecology which assume that a family of offspring has come from only two parents. Here, we present a simple test for detecting when a batch involves two or more subfamilies. It is based on the fact that the mixing of families generates associations amongst unlinked marker loci. We also present simulations illustrating the power of our method for varying numbers of loci, alleles per locus and genotyped individuals.","lang":"eng"}],"quality_controlled":0,"author":[{"full_name":"Vines, Timothy H","first_name":"Timothy","last_name":"Vines"},{"full_name":"Nicholas Barton","orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","last_name":"Barton","first_name":"Nicholas H"}],"extern":1,"citation":{"ista":"Vines T, Barton NH. 2003. A new approach to detecting mixed families. Molecular Ecology. 12(7), 1999–2002.","chicago":"Vines, Timothy, and Nicholas H Barton. “A New Approach to Detecting Mixed Families.” <i>Molecular Ecology</i>. Wiley-Blackwell, 2003. <a href=\"https://doi.org/10.1046/j.1365-294X.2003.01867.x\">https://doi.org/10.1046/j.1365-294X.2003.01867.x</a>.","short":"T. Vines, N.H. Barton, Molecular Ecology 12 (2003) 1999–2002.","ama":"Vines T, Barton NH. A new approach to detecting mixed families. <i>Molecular Ecology</i>. 2003;12(7):1999-2002. doi:<a href=\"https://doi.org/10.1046/j.1365-294X.2003.01867.x\">10.1046/j.1365-294X.2003.01867.x</a>","ieee":"T. Vines and N. H. Barton, “A new approach to detecting mixed families,” <i>Molecular Ecology</i>, vol. 12, no. 7. Wiley-Blackwell, pp. 1999–2002, 2003.","apa":"Vines, T., &#38; Barton, N. H. (2003). A new approach to detecting mixed families. <i>Molecular Ecology</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1046/j.1365-294X.2003.01867.x\">https://doi.org/10.1046/j.1365-294X.2003.01867.x</a>","mla":"Vines, Timothy, and Nicholas H. Barton. “A New Approach to Detecting Mixed Families.” <i>Molecular Ecology</i>, vol. 12, no. 7, Wiley-Blackwell, 2003, pp. 1999–2002, doi:<a href=\"https://doi.org/10.1046/j.1365-294X.2003.01867.x\">10.1046/j.1365-294X.2003.01867.x</a>."},"day":"01","year":"2003","type":"journal_article","date_updated":"2021-01-12T07:44:42Z","publist_id":"2765","intvolume":"        12","status":"public","date_created":"2018-12-11T12:04:16Z","month":"07","issue":"7","page":"1999 - 2002","volume":12,"date_published":"2003-07-01T00:00:00Z","publisher":"Wiley-Blackwell"},{"date_created":"2018-12-11T12:04:17Z","month":"12","status":"public","intvolume":"        64","publist_id":"2764","publisher":"Academic Press","date_published":"2003-12-01T00:00:00Z","page":"451 - 471","issue":"4","volume":64,"publication_status":"published","abstract":[{"text":"What is the chance that some part of a stretch of genome will survive? In a population of constant size, and with no selection, the probability of survival of some part of a stretch of map length y&lt;1 approaches View the MathML source for View the MathML source. Thus, the whole genome is certain to be lost, but the rate of loss is extremely slow. This solution extends to give the whole distribution of surviving block sizes as a function of time. We show that the expected number of blocks at time t is 1+yt and give expressions for the moments of the number of blocks and the total amount of genome that survives for a given time. The solution is based on a branching process and assumes complete interference between crossovers, so that each descendant carries only a single block of ancestral material. We consider cases where most individuals carry multiple blocks, either because there are multiple crossovers in a long genetic map, or because enough time has passed that most individuals in the population are related to each other. For species such as ours, which have a long genetic map, the genome of any individual which leaves descendants (∼80% of the population for a Poisson offspring number with mean two) is likely to persist for an extremely long time, in the form of a few short blocks of genome.","lang":"eng"}],"title":"The distribution of surviving blocks of an ancestral genome","publication":"Theoretical Population Biology","doi":"10.1016/S0040-5809(03)00098-4","_id":"3619","type":"journal_article","date_updated":"2021-01-12T07:44:42Z","day":"01","year":"2003","citation":{"mla":"Baird, Stuart, et al. “The Distribution of Surviving Blocks of an Ancestral Genome.” <i>Theoretical Population Biology</i>, vol. 64, no. 4, Academic Press, 2003, pp. 451–71, doi:<a href=\"https://doi.org/10.1016/S0040-5809(03)00098-4\">10.1016/S0040-5809(03)00098-4</a>.","apa":"Baird, S., Barton, N. H., &#38; Etheridge, A. (2003). The distribution of surviving blocks of an ancestral genome. <i>Theoretical Population Biology</i>. Academic Press. <a href=\"https://doi.org/10.1016/S0040-5809(03)00098-4\">https://doi.org/10.1016/S0040-5809(03)00098-4</a>","ieee":"S. Baird, N. H. Barton, and A. Etheridge, “The distribution of surviving blocks of an ancestral genome,” <i>Theoretical Population Biology</i>, vol. 64, no. 4. Academic Press, pp. 451–471, 2003.","ama":"Baird S, Barton NH, Etheridge A. The distribution of surviving blocks of an ancestral genome. <i>Theoretical Population Biology</i>. 2003;64(4):451-471. doi:<a href=\"https://doi.org/10.1016/S0040-5809(03)00098-4\">10.1016/S0040-5809(03)00098-4</a>","chicago":"Baird, Stuart, Nicholas H Barton, and Alison Etheridge. “The Distribution of Surviving Blocks of an Ancestral Genome.” <i>Theoretical Population Biology</i>. Academic Press, 2003. <a href=\"https://doi.org/10.1016/S0040-5809(03)00098-4\">https://doi.org/10.1016/S0040-5809(03)00098-4</a>.","short":"S. Baird, N.H. Barton, A. Etheridge, Theoretical Population Biology 64 (2003) 451–471.","ista":"Baird S, Barton NH, Etheridge A. 2003. The distribution of surviving blocks of an ancestral genome. Theoretical Population Biology. 64(4), 451–471."},"extern":1,"author":[{"full_name":"Baird, Stuart J","first_name":"Stuart","last_name":"Baird"},{"full_name":"Nicholas Barton","orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H","last_name":"Barton"},{"first_name":"Alison","last_name":"Etheridge","full_name":"Etheridge, Alison M"}],"quality_controlled":0},{"date_published":"2003-08-01T00:00:00Z","volume":91,"issue":"2","page":"136 - 142","publisher":"Nature Publishing Group","intvolume":"        91","publist_id":"2763","date_created":"2018-12-11T12:04:17Z","month":"08","status":"public","citation":{"ieee":"B. Nürnberger <i>et al.</i>, “A linkage map for the hybridising toads Bombina bombina and B. variegata (Anura: Discoglossidae),” <i>Heredity</i>, vol. 91, no. 2. Nature Publishing Group, pp. 136–142, 2003.","ama":"Nürnberger B, Hofman S, Förg Brey B, et al. A linkage map for the hybridising toads Bombina bombina and B. variegata (Anura: Discoglossidae). <i>Heredity</i>. 2003;91(2):136-142. doi:<a href=\"https://doi.org/10.1038/sj.hdy.6800291\">10.1038/sj.hdy.6800291</a>","ista":"Nürnberger B, Hofman S, Förg Brey B, Praetzel G, Maclean A, Szymura J, Abbott C, Barton NH. 2003. A linkage map for the hybridising toads Bombina bombina and B. variegata (Anura: Discoglossidae). Heredity. 91(2), 136–142.","chicago":"Nürnberger, Beate, Sebastian Hofman, Bqruni Förg Brey, Gabriele Praetzel, Alan Maclean, Jacek Szymura, Catherine Abbott, and Nicholas H Barton. “A Linkage Map for the Hybridising Toads Bombina Bombina and B. Variegata (Anura: Discoglossidae).” <i>Heredity</i>. Nature Publishing Group, 2003. <a href=\"https://doi.org/10.1038/sj.hdy.6800291\">https://doi.org/10.1038/sj.hdy.6800291</a>.","short":"B. Nürnberger, S. Hofman, B. Förg Brey, G. Praetzel, A. Maclean, J. Szymura, C. Abbott, N.H. Barton, Heredity 91 (2003) 136–142.","mla":"Nürnberger, Beate, et al. “A Linkage Map for the Hybridising Toads Bombina Bombina and B. Variegata (Anura: Discoglossidae).” <i>Heredity</i>, vol. 91, no. 2, Nature Publishing Group, 2003, pp. 136–42, doi:<a href=\"https://doi.org/10.1038/sj.hdy.6800291\">10.1038/sj.hdy.6800291</a>.","apa":"Nürnberger, B., Hofman, S., Förg Brey, B., Praetzel, G., Maclean, A., Szymura, J., … Barton, N. H. (2003). A linkage map for the hybridising toads Bombina bombina and B. variegata (Anura: Discoglossidae). <i>Heredity</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/sj.hdy.6800291\">https://doi.org/10.1038/sj.hdy.6800291</a>"},"quality_controlled":0,"extern":1,"author":[{"first_name":"Beate","last_name":"Nürnberger","full_name":"Nürnberger, Beate"},{"full_name":"Hofman, Sebastian","first_name":"Sebastian","last_name":"Hofman"},{"full_name":"Förg-Brey, Bqruni","first_name":"Bqruni","last_name":"Förg Brey"},{"first_name":"Gabriele","last_name":"Praetzel","full_name":"Praetzel, Gabriele"},{"last_name":"Maclean","first_name":"Alan","full_name":"Maclean, Alan W"},{"last_name":"Szymura","first_name":"Jacek","full_name":"Szymura, Jacek M"},{"full_name":"Abbott, Catherine M","first_name":"Catherine","last_name":"Abbott"},{"first_name":"Nicholas H","last_name":"Barton","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8548-5240","full_name":"Nicholas Barton"}],"type":"journal_article","date_updated":"2021-01-12T07:44:43Z","day":"01","year":"2003","publication":"Heredity","title":"A linkage map for the hybridising toads Bombina bombina and B. variegata (Anura: Discoglossidae)","doi":"10.1038/sj.hdy.6800291","_id":"3620","publication_status":"published","abstract":[{"text":"Stable hybrid zones in which ecologically divergent taxa give rise to a range of recombinants are natural laboratories in which the genetic basis of adaptation and reproductive isolation can be unraveled. One such hybrid zone is formed by the fire-bellied toads Bombina bombina and B. variegata (Anura: Discoglossidae). Adaptations to permanent and ephemeral breeding habitats, respectively, have shaped numerous phenotypic differences between the taxa. All of these are, in principle, candidates for a genetic dissection via QTL mapping. We present here a linkage map of 28 codominant and 10 dominant markers in the Bombina genome. In an F2 cross, markers that were mainly microsatellites, SSCPs or allozymes were mapped to 20 linkage groups. Among the 40 isolated CA microsatellites, we noted a preponderance of compound and frequently interleaved CA-TA repeats as well as a striking polarity at the 5′ end of the repeats.","lang":"eng"}]},{"status":"public","date_created":"2018-12-11T12:04:34Z","month":"03","publist_id":"2704","intvolume":"       356","publisher":"Universität Bonn, Fachbibliothek Mathematik","page":"1 - 165","volume":356,"date_published":"2003-03-31T00:00:00Z","publication_status":"published","_id":"3678","publication":"Bonner Mathematische Schriften","title":"The Neumann operator in strictly pseudoconvex domains with weighted Bergman metric ","day":"31","year":"2003","date_updated":"2021-01-12T07:45:05Z","type":"dissertation","quality_controlled":0,"extern":1,"author":[{"last_name":"Lampert","first_name":"Christoph","orcid":"0000-0001-8622-7887","full_name":"Christoph Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87"}],"citation":{"mla":"Lampert, Christoph. “The Neumann Operator in Strictly Pseudoconvex Domains with Weighted Bergman Metric .” <i>Bonner Mathematische Schriften</i>, vol. 356, Universität Bonn, Fachbibliothek Mathematik, 2003, pp. 1–165.","apa":"Lampert, C. (2003). <i>The Neumann operator in strictly pseudoconvex domains with weighted Bergman metric </i>. <i>Bonner Mathematische Schriften</i>. Universität Bonn, Fachbibliothek Mathematik.","ama":"Lampert C. The Neumann operator in strictly pseudoconvex domains with weighted Bergman metric . <i>Bonner Mathematische Schriften</i>. 2003;356:1-165.","ieee":"C. Lampert, “The Neumann operator in strictly pseudoconvex domains with weighted Bergman metric ,” Universität Bonn, Fachbibliothek Mathematik, 2003.","chicago":"Lampert, Christoph. “The Neumann Operator in Strictly Pseudoconvex Domains with Weighted Bergman Metric .” <i>Bonner Mathematische Schriften</i>. Universität Bonn, Fachbibliothek Mathematik, 2003.","short":"C. Lampert, The Neumann Operator in Strictly Pseudoconvex Domains with Weighted Bergman Metric , Universität Bonn, Fachbibliothek Mathematik, 2003.","ista":"Lampert C. 2003. The Neumann operator in strictly pseudoconvex domains with weighted Bergman metric . Universität Bonn, Fachbibliothek Mathematik."},"main_file_link":[{"open_access":"0","url":"http://pub.ist.ac.at/~chl/papers/lampert-phd2003.pdf"}]}]