[{"language":[{"iso":"eng"}],"fulldoi":"https://doi.org/10.1007/978-3-642-33863-2_6","day":"31","date_published":"2012-08-31T00:00:00Z","page":"52-62","date_updated":"2025-01-16T12:29:07Z","abstract":[{"lang":"eng","text":"We present a novel method for estimation of articulated motion in depth scans. The method is based on a framework for regularization of vector- and matrix- valued functions on parametric surfaces.\r\n\r\nWe extend augmented-Lagrangian total variation regularization to smooth rigid motion cues on the scanned 3D surface obtained from a range scanner. We demonstrate the resulting smoothed motion maps to be a powerful tool in articulated scene understanding, providing a basis for rigid parts segmentation, with little prior assumptions on the scene, despite the noisy depth measurements that often appear in commodity depth scanners."}],"conference":{"start_date":"2012-10-07","location":"Florence, Italy","name":"ECCV: European Conference on Computer Vision","end_date":"2012-10-13"},"title":"Group-valued regularization for analysis of articulated motion","doi":"10.1007/978-3-642-33863-2_6","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publisher":"Springer Nature","_id":"18348","status":"public","type":"conference","author":[{"last_name":"Rosman","first_name":"Guy","full_name":"Rosman, Guy"},{"id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","first_name":"Alexander","orcid":"0000-0001-9699-8730","full_name":"Bronstein, Alexander","last_name":"Bronstein"},{"first_name":"Michael M.","full_name":"Bronstein, Michael M.","last_name":"Bronstein"},{"first_name":"Xue-Cheng","full_name":"Tai, Xue-Cheng","last_name":"Tai"},{"first_name":"Ron","full_name":"Kimmel, Ron","last_name":"Kimmel"}],"publication_status":"published","year":"2012","article_processing_charge":"No","oa_version":"None","intvolume":"      7583","issue":"Part 1","month":"08","extern":"1","alternative_title":["LNCS"],"citation":{"apa":"Rosman, G., Bronstein, A. M., Bronstein, M. M., Tai, X.-C., &#38; Kimmel, R. (2012). Group-valued regularization for analysis of articulated motion. In <i>Computer Vision, ECCV 2012 - Workshops and Demonstrations</i> (Vol. 7583, pp. 52–62). Florence, Italy: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-642-33863-2_6\">https://doi.org/10.1007/978-3-642-33863-2_6</a>","ieee":"G. Rosman, A. M. Bronstein, M. M. Bronstein, X.-C. Tai, and R. Kimmel, “Group-valued regularization for analysis of articulated motion,” in <i>Computer Vision, ECCV 2012 - Workshops and Demonstrations</i>, Florence, Italy, 2012, vol. 7583, no. Part 1, pp. 52–62.","short":"G. Rosman, A.M. Bronstein, M.M. Bronstein, X.-C. Tai, R. Kimmel, in:, Computer Vision, ECCV 2012 - Workshops and Demonstrations, Springer Nature, 2012, pp. 52–62.","chicago":"Rosman, Guy, Alex M. Bronstein, Michael M. Bronstein, Xue-Cheng Tai, and Ron Kimmel. “Group-Valued Regularization for Analysis of Articulated Motion.” In <i>Computer Vision, ECCV 2012 - Workshops and Demonstrations</i>, 7583:52–62. Springer Nature, 2012. <a href=\"https://doi.org/10.1007/978-3-642-33863-2_6\">https://doi.org/10.1007/978-3-642-33863-2_6</a>.","ista":"Rosman G, Bronstein AM, Bronstein MM, Tai X-C, Kimmel R. 2012. Group-valued regularization for analysis of articulated motion. Computer Vision, ECCV 2012 - Workshops and Demonstrations. ECCV: European Conference on Computer Vision, LNCS, vol. 7583, 52–62.","mla":"Rosman, Guy, et al. “Group-Valued Regularization for Analysis of Articulated Motion.” <i>Computer Vision, ECCV 2012 - Workshops and Demonstrations</i>, vol. 7583, no. Part 1, Springer Nature, 2012, pp. 52–62, doi:<a href=\"https://doi.org/10.1007/978-3-642-33863-2_6\">10.1007/978-3-642-33863-2_6</a>.","ama":"Rosman G, Bronstein AM, Bronstein MM, Tai X-C, Kimmel R. Group-valued regularization for analysis of articulated motion. In: <i>Computer Vision, ECCV 2012 - Workshops and Demonstrations</i>. Vol 7583. Springer Nature; 2012:52-62. doi:<a href=\"https://doi.org/10.1007/978-3-642-33863-2_6\">10.1007/978-3-642-33863-2_6</a>"},"publication":"Computer Vision, ECCV 2012 - Workshops and Demonstrations","date_created":"2024-10-15T11:20:54Z","scopus_import":"1","quality_controlled":"1","volume":7583,"publication_identifier":{"eisbn":["9783642338632"],"isbn":["9783642338625"],"eissn":["1611-3349"],"issn":["0302-9743"]}},{"volume":7583,"publication_identifier":{"isbn":["9783642338625","9783642338632"],"issn":["0302-9743","1611-3349"]},"quality_controlled":"1","date_created":"2024-10-15T11:20:54Z","scopus_import":"1","publication":"Computer Vision, ECCV 2012 - Workshops and Demonstrations","citation":{"short":"A. Kovnatsky, M.M. Bronstein, A.M. Bronstein, in:, Computer Vision, ECCV 2012 - Workshops and Demonstrations, Springer Nature, 2012, pp. 83–91.","ieee":"A. Kovnatsky, M. M. Bronstein, and A. M. Bronstein, “Stable Spectral Mesh Filtering,” in <i>Computer Vision, ECCV 2012 - Workshops and Demonstrations</i>, Florence, Italy, 2012, vol. 7583, no. Part 1, pp. 83–91.","apa":"Kovnatsky, A., Bronstein, M. M., &#38; Bronstein, A. M. (2012). Stable Spectral Mesh Filtering. In <i>Computer Vision, ECCV 2012 - Workshops and Demonstrations</i> (Vol. 7583, pp. 83–91). Florence, Italy: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-642-33863-2_9\">https://doi.org/10.1007/978-3-642-33863-2_9</a>","chicago":"Kovnatsky, Artiom, Michael M. Bronstein, and Alex M. Bronstein. “Stable Spectral Mesh Filtering.” In <i>Computer Vision, ECCV 2012 - Workshops and Demonstrations</i>, 7583:83–91. Springer Nature, 2012. <a href=\"https://doi.org/10.1007/978-3-642-33863-2_9\">https://doi.org/10.1007/978-3-642-33863-2_9</a>.","ista":"Kovnatsky A, Bronstein MM, Bronstein AM. 2012. Stable Spectral Mesh Filtering. Computer Vision, ECCV 2012 - Workshops and Demonstrations. ECCV: European Conference on Computer Vision, LNCS, vol. 7583, 83–91.","ama":"Kovnatsky A, Bronstein MM, Bronstein AM. Stable Spectral Mesh Filtering. In: <i>Computer Vision, ECCV 2012 - Workshops and Demonstrations</i>. Vol 7583. Springer Nature; 2012:83-91. doi:<a href=\"https://doi.org/10.1007/978-3-642-33863-2_9\">10.1007/978-3-642-33863-2_9</a>","mla":"Kovnatsky, Artiom, et al. “Stable Spectral Mesh Filtering.” <i>Computer Vision, ECCV 2012 - Workshops and Demonstrations</i>, vol. 7583, no. Part 1, Springer Nature, 2012, pp. 83–91, doi:<a href=\"https://doi.org/10.1007/978-3-642-33863-2_9\">10.1007/978-3-642-33863-2_9</a>."},"alternative_title":["LNCS"],"extern":"1","month":"08","oa_version":"None","issue":"Part 1","intvolume":"      7583","year":"2012","article_processing_charge":"No","author":[{"last_name":"Kovnatsky","first_name":"Artiom","full_name":"Kovnatsky, Artiom"},{"first_name":"Michael M.","full_name":"Bronstein, Michael M.","last_name":"Bronstein"},{"last_name":"Bronstein","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","first_name":"Alexander","orcid":"0000-0001-9699-8730","full_name":"Bronstein, Alexander"}],"publication_status":"published","_id":"18349","status":"public","type":"conference","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publisher":"Springer Nature","doi":"10.1007/978-3-642-33863-2_9","title":"Stable Spectral Mesh Filtering","abstract":[{"lang":"eng","text":"The rapid development of 3D acquisition technology has brought with itself the need to perform standard signal processing operations such as filters on 3D data. It has been shown that the eigenfunctions of the Laplace-Beltrami operator (manifold harmonics) of a surface play the role of the Fourier basis in the Euclidean space; it is thus possible to formulate signal analysis and synthesis in the manifold harmonics basis. In particular, geometry filtering can be carried out in the manifold harmonics domain by decomposing the embedding coordinates of the shape in this basis. However, since the basis functions depend on the shape itself, such filtering is valid only for weak (near all-pass) filters, and produces severe artifacts otherwise. In this paper, we analyze this problem and propose the fractional filtering approach, wherein we apply iteratively weak fractional powers of the filter, followed by the update of the basis functions. Experimental results show that such a process produces more plausible and meaningful results."}],"conference":{"end_date":"2012-10-13","name":"ECCV: European Conference on Computer Vision","start_date":"2012-10-07","location":"Florence, Italy"},"page":"83-91","date_updated":"2025-01-16T11:49:13Z","date_published":"2012-08-31T00:00:00Z","day":"31","language":[{"iso":"eng"}],"fulldoi":"https://doi.org/10.1007/978-3-642-33863-2_9"},{"citation":{"ista":"Raviv D, Bronstein AM, Bronstein MM, Kimmel R, Sochen N. 2012. Equi-affine invariant geometries of articulated objects. 15th International Workshop on Theoretical Foundations of Computer Vision. International Workshop on Theoretical Foundations of Computer Vision, LNCS, vol. 7474, 177–190.","mla":"Raviv, Dan, et al. “Equi-Affine Invariant Geometries of Articulated Objects.” <i>15th International Workshop on Theoretical Foundations of Computer Vision</i>, vol. 7474, Springer Nature, 2012, pp. 177–90, doi:<a href=\"https://doi.org/10.1007/978-3-642-34091-8_8\">10.1007/978-3-642-34091-8_8</a>.","ama":"Raviv D, Bronstein AM, Bronstein MM, Kimmel R, Sochen N. Equi-affine invariant geometries of articulated objects. In: <i>15th International Workshop on Theoretical Foundations of Computer Vision</i>. Vol 7474. Springer Nature; 2012:177-190. doi:<a href=\"https://doi.org/10.1007/978-3-642-34091-8_8\">10.1007/978-3-642-34091-8_8</a>","short":"D. Raviv, A.M. Bronstein, M.M. Bronstein, R. Kimmel, N. Sochen, in:, 15th International Workshop on Theoretical Foundations of Computer Vision, Springer Nature, 2012, pp. 177–190.","ieee":"D. Raviv, A. M. Bronstein, M. M. Bronstein, R. Kimmel, and N. Sochen, “Equi-affine invariant geometries of articulated objects,” in <i>15th International Workshop on Theoretical Foundations of Computer Vision</i>, Dagstuhl, Germany, 2012, vol. 7474, pp. 177–190.","apa":"Raviv, D., Bronstein, A. M., Bronstein, M. M., Kimmel, R., &#38; Sochen, N. (2012). Equi-affine invariant geometries of articulated objects. In <i>15th International Workshop on Theoretical Foundations of Computer Vision</i> (Vol. 7474, pp. 177–190). Dagstuhl, Germany: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-642-34091-8_8\">https://doi.org/10.1007/978-3-642-34091-8_8</a>","chicago":"Raviv, Dan, Alex M. Bronstein, Michael M. Bronstein, Ron Kimmel, and Nir Sochen. “Equi-Affine Invariant Geometries of Articulated Objects.” In <i>15th International Workshop on Theoretical Foundations of Computer Vision</i>, 7474:177–90. Springer Nature, 2012. <a href=\"https://doi.org/10.1007/978-3-642-34091-8_8\">https://doi.org/10.1007/978-3-642-34091-8_8</a>."},"alternative_title":["LNCS"],"extern":"1","date_created":"2024-10-15T11:20:54Z","scopus_import":"1","publication":"15th International Workshop on Theoretical Foundations of Computer Vision","volume":7474,"publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["9783642340901"],"eisbn":["9783642340918"]},"quality_controlled":"1","author":[{"last_name":"Raviv","first_name":"Dan","full_name":"Raviv, Dan"},{"last_name":"Bronstein","first_name":"Alexander","full_name":"Bronstein, Alexander","orcid":"0000-0001-9699-8730","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6"},{"full_name":"Bronstein, Michael M.","first_name":"Michael M.","last_name":"Bronstein"},{"full_name":"Kimmel, Ron","first_name":"Ron","last_name":"Kimmel"},{"full_name":"Sochen, Nir","first_name":"Nir","last_name":"Sochen"}],"publication_status":"published","year":"2012","article_processing_charge":"No","month":"09","intvolume":"      7474","oa_version":"None","date_updated":"2025-01-16T10:12:48Z","page":"177-190","title":"Equi-affine invariant geometries of articulated objects","abstract":[{"text":"We introduce an (equi-)affine invariant geometric structure by which surfaces that go through squeeze and shear transformations can still be properly analyzed. The definition of an affine invariant metric enables us to evaluate a new form of geodesic distances and to construct an invariant Laplacian from which local and global diffusion geometry is constructed. Applications of the proposed framework demonstrate its power in generalizing and enriching the existing set of tools for shape analysis.","lang":"eng"}],"conference":{"location":"Dagstuhl, Germany","start_date":"2011-06-26","name":"International Workshop on Theoretical Foundations of Computer Vision","end_date":"2011-07-01"},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publisher":"Springer Nature","doi":"10.1007/978-3-642-34091-8_8","_id":"18350","status":"public","type":"conference","language":[{"iso":"eng"}],"fulldoi":"https://doi.org/10.1007/978-3-642-34091-8_8","date_published":"2012-09-01T00:00:00Z","day":"01"},{"doi":"10.1016/j.cag.2012.03.034","publisher":"Elsevier","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","status":"public","_id":"18364","page":"569-576","date_updated":"2024-11-12T08:42:27Z","abstract":[{"lang":"eng","text":"Region feature detectors and descriptors have become a successful and popular alternative to point descriptors in image analysis due to their high robustness and repeatability, leading to a significant interest in the shape analysis community in finding analogous approaches in the 3D world. Recent works have successfully extended the maximally stable extremal region (MSER) detection algorithm to surfaces. In many applications, however, a volumetric shape model is more appropriate, and modeling shape deformations as approximate isometries of the volume of an object, rather than its boundary, better captures natural behavior of non-rigid deformations. In this paper, we formulate a diffusion-geometric framework for volumetric stable component detection and description in deformable shapes. An evaluation of our method on the SHREC'11 feature detection benchmark and SCAPE human body scans shows its potential as a source of high-quality features. Examples demonstrating the drawbacks of surface stable components and the advantage of their volumetric counterparts are also presented."}],"title":"Stable volumetric features in deformable shapes","fulldoi":"https://doi.org/10.1016/j.cag.2012.03.034","language":[{"iso":"eng"}],"date_published":"2012-08-01T00:00:00Z","day":"01","quality_controlled":"1","publication_identifier":{"issn":["0097-8493"]},"volume":36,"extern":"1","citation":{"apa":"Litman, R., Bronstein, A. M., &#38; Bronstein, M. M. (2012). Stable volumetric features in deformable shapes. <i>Computers &#38; Graphics</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.cag.2012.03.034\">https://doi.org/10.1016/j.cag.2012.03.034</a>","ieee":"R. Litman, A. M. Bronstein, and M. M. Bronstein, “Stable volumetric features in deformable shapes,” <i>Computers &#38; Graphics</i>, vol. 36, no. 5. Elsevier, pp. 569–576, 2012.","short":"R. Litman, A.M. Bronstein, M.M. Bronstein, Computers &#38; Graphics 36 (2012) 569–576.","chicago":"Litman, R., Alex M. Bronstein, and M.M. Bronstein. “Stable Volumetric Features in Deformable Shapes.” <i>Computers &#38; Graphics</i>. Elsevier, 2012. <a href=\"https://doi.org/10.1016/j.cag.2012.03.034\">https://doi.org/10.1016/j.cag.2012.03.034</a>.","ista":"Litman R, Bronstein AM, Bronstein MM. 2012. Stable volumetric features in deformable shapes. Computers &#38; Graphics. 36(5), 569–576.","ama":"Litman R, Bronstein AM, Bronstein MM. Stable volumetric features in deformable shapes. <i>Computers &#38; Graphics</i>. 2012;36(5):569-576. doi:<a href=\"https://doi.org/10.1016/j.cag.2012.03.034\">10.1016/j.cag.2012.03.034</a>","mla":"Litman, R., et al. “Stable Volumetric Features in Deformable Shapes.” <i>Computers &#38; Graphics</i>, vol. 36, no. 5, Elsevier, 2012, pp. 569–76, doi:<a href=\"https://doi.org/10.1016/j.cag.2012.03.034\">10.1016/j.cag.2012.03.034</a>."},"publication":"Computers & Graphics","scopus_import":"1","date_created":"2024-10-15T11:20:54Z","article_processing_charge":"No","year":"2012","issue":"5","oa_version":"None","intvolume":"        36","month":"08","article_type":"original","publication_status":"published","author":[{"last_name":"Litman","full_name":"Litman, R.","first_name":"R."},{"last_name":"Bronstein","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","full_name":"Bronstein, Alexander","orcid":"0000-0001-9699-8730","first_name":"Alexander"},{"last_name":"Bronstein","full_name":"Bronstein, M.M.","first_name":"M.M."}]},{"month":"07","oa_version":"None","article_processing_charge":"No","year":"2012","day":"26","date_published":"2012-07-26T00:00:00Z","publication_status":"published","fulldoi":"https://doi.org/10.1109/cvpr.2012.6247671","language":[{"iso":"eng"}],"author":[{"full_name":"Kokkinos, I.","first_name":"I.","last_name":"Kokkinos"},{"first_name":"M. M.","full_name":"Bronstein, M. M.","last_name":"Bronstein"},{"last_name":"Litman","full_name":"Litman, R.","first_name":"R."},{"last_name":"Bronstein","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","full_name":"Bronstein, Alexander","orcid":"0000-0001-9699-8730","first_name":"Alexander"}],"type":"conference","publication_identifier":{"eissn":["1063-6919"],"isbn":["9781467312264"]},"_id":"18378","status":"public","quality_controlled":"1","publisher":"IEEE","article_number":"6247671","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","doi":"10.1109/cvpr.2012.6247671","scopus_import":"1","title":"Intrinsic shape context descriptors for deformable shapes","date_created":"2024-10-15T11:20:54Z","conference":{"end_date":"2012-06-21","name":"IEEE Conference on Computer Vision and Pattern Recognition","location":"Providence, RI, United States","start_date":"2012-06-16"},"abstract":[{"lang":"eng","text":"In this work, we present intrinsic shape context (ISC) descriptors for 3D shapes. We generalize to surfaces the polar sampling of the image domain used in shape contexts: for this purpose, we chart the surface by shooting geodesic outwards from the point being analyzed; `angle' is treated as tantamount to geodesic shooting direction, and radius as geodesic distance. To deal with orientation ambiguity, we exploit properties of the Fourier transform. Our charting method is intrinsic, i.e., invariant to isometric shape transformations. The resulting descriptor is a meta-descriptor that can be applied to any photometric or geometric property field defined on the shape, in particular, we can leverage recent developments in intrinsic shape analysis and construct ISC based on state-of-the-art dense shape descriptors such as heat kernel signatures. Our experiments demonstrate a notable improvement in shape matching on standard benchmarks."}],"publication":"2012 IEEE Conference on Computer Vision and Pattern Recognition","citation":{"chicago":"Kokkinos, I., M. M. Bronstein, R. Litman, and Alex M. Bronstein. “Intrinsic Shape Context Descriptors for Deformable Shapes.” In <i>2012 IEEE Conference on Computer Vision and Pattern Recognition</i>. IEEE, 2012. <a href=\"https://doi.org/10.1109/cvpr.2012.6247671\">https://doi.org/10.1109/cvpr.2012.6247671</a>.","short":"I. Kokkinos, M.M. Bronstein, R. Litman, A.M. Bronstein, in:, 2012 IEEE Conference on Computer Vision and Pattern Recognition, IEEE, 2012.","apa":"Kokkinos, I., Bronstein, M. M., Litman, R., &#38; Bronstein, A. M. (2012). Intrinsic shape context descriptors for deformable shapes. In <i>2012 IEEE Conference on Computer Vision and Pattern Recognition</i>. Providence, RI, United States: IEEE. <a href=\"https://doi.org/10.1109/cvpr.2012.6247671\">https://doi.org/10.1109/cvpr.2012.6247671</a>","ieee":"I. Kokkinos, M. M. Bronstein, R. Litman, and A. M. Bronstein, “Intrinsic shape context descriptors for deformable shapes,” in <i>2012 IEEE Conference on Computer Vision and Pattern Recognition</i>, Providence, RI, United States, 2012.","ama":"Kokkinos I, Bronstein MM, Litman R, Bronstein AM. Intrinsic shape context descriptors for deformable shapes. In: <i>2012 IEEE Conference on Computer Vision and Pattern Recognition</i>. IEEE; 2012. doi:<a href=\"https://doi.org/10.1109/cvpr.2012.6247671\">10.1109/cvpr.2012.6247671</a>","mla":"Kokkinos, I., et al. “Intrinsic Shape Context Descriptors for Deformable Shapes.” <i>2012 IEEE Conference on Computer Vision and Pattern Recognition</i>, 6247671, IEEE, 2012, doi:<a href=\"https://doi.org/10.1109/cvpr.2012.6247671\">10.1109/cvpr.2012.6247671</a>.","ista":"Kokkinos I, Bronstein MM, Litman R, Bronstein AM. 2012. Intrinsic shape context descriptors for deformable shapes. 2012 IEEE Conference on Computer Vision and Pattern Recognition. IEEE Conference on Computer Vision and Pattern Recognition, 6247671."},"extern":"1","date_updated":"2024-12-04T12:27:48Z"},{"day":"26","date_published":"2012-07-26T00:00:00Z","language":[{"iso":"eng"}],"author":[{"first_name":"E.","full_name":"Rodola, E.","last_name":"Rodola"},{"id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","first_name":"Alexander","full_name":"Bronstein, Alexander","orcid":"0000-0001-9699-8730","last_name":"Bronstein"},{"last_name":"Albarelli","first_name":"A.","full_name":"Albarelli, A."},{"first_name":"F.","full_name":"Bergamasco, F.","last_name":"Bergamasco"},{"first_name":"A.","full_name":"Torsello, A.","last_name":"Torsello"}],"publication_status":"published","fulldoi":"https://doi.org/10.1109/cvpr.2012.6247674","oa_version":"None","month":"07","year":"2012","article_processing_charge":"No","publication":"2012 IEEE Conference on Computer Vision and Pattern Recognition","abstract":[{"lang":"eng","text":"We consider the problem of minimum distortion intrinsic correspondence between deformable shapes, many useful formulations of which give rise to the NP-hard quadratic assignment problem (QAP). Previous attempts to use the spectral relaxation have had limited success due to the lack of sparsity of the obtained “fuzzy” solution. In this paper, we adopt the recently introduced alternative L 1 relaxation of the QAP based on the principles of game theory. We relate it to the Gromov and Lipschitz metrics between metric spaces and demonstrate on state-of-the-art benchmarks that the proposed approach is capable of finding very accurate sparse correspondences between deformable shapes."}],"conference":{"end_date":"2012-06-21","location":"Providence, RI, United States","start_date":"2012-06-16","name":"IEEE Conference on Computer Vision and Pattern Recognition"},"title":"A game-theoretic approach to deformable shape matching","date_created":"2024-10-15T11:20:54Z","scopus_import":"1","date_updated":"2024-12-04T12:22:03Z","extern":"1","citation":{"chicago":"Rodola, E., Alex M. Bronstein, A. Albarelli, F. Bergamasco, and A. Torsello. “A Game-Theoretic Approach to Deformable Shape Matching.” In <i>2012 IEEE Conference on Computer Vision and Pattern Recognition</i>. IEEE, 2012. <a href=\"https://doi.org/10.1109/cvpr.2012.6247674\">https://doi.org/10.1109/cvpr.2012.6247674</a>.","ieee":"E. Rodola, A. M. Bronstein, A. Albarelli, F. Bergamasco, and A. Torsello, “A game-theoretic approach to deformable shape matching,” in <i>2012 IEEE Conference on Computer Vision and Pattern Recognition</i>, Providence, RI, United States, 2012.","apa":"Rodola, E., Bronstein, A. M., Albarelli, A., Bergamasco, F., &#38; Torsello, A. (2012). A game-theoretic approach to deformable shape matching. In <i>2012 IEEE Conference on Computer Vision and Pattern Recognition</i>. Providence, RI, United States: IEEE. <a href=\"https://doi.org/10.1109/cvpr.2012.6247674\">https://doi.org/10.1109/cvpr.2012.6247674</a>","short":"E. Rodola, A.M. Bronstein, A. Albarelli, F. Bergamasco, A. Torsello, in:, 2012 IEEE Conference on Computer Vision and Pattern Recognition, IEEE, 2012.","mla":"Rodola, E., et al. “A Game-Theoretic Approach to Deformable Shape Matching.” <i>2012 IEEE Conference on Computer Vision and Pattern Recognition</i>, 6247674, IEEE, 2012, doi:<a href=\"https://doi.org/10.1109/cvpr.2012.6247674\">10.1109/cvpr.2012.6247674</a>.","ama":"Rodola E, Bronstein AM, Albarelli A, Bergamasco F, Torsello A. A game-theoretic approach to deformable shape matching. In: <i>2012 IEEE Conference on Computer Vision and Pattern Recognition</i>. IEEE; 2012. doi:<a href=\"https://doi.org/10.1109/cvpr.2012.6247674\">10.1109/cvpr.2012.6247674</a>","ista":"Rodola E, Bronstein AM, Albarelli A, Bergamasco F, Torsello A. 2012. A game-theoretic approach to deformable shape matching. 2012 IEEE Conference on Computer Vision and Pattern Recognition. IEEE Conference on Computer Vision and Pattern Recognition, 6247674."},"quality_controlled":"1","_id":"18379","status":"public","publication_identifier":{"eissn":["1063-6919"],"isbn":["978-1-4673-1226-4"]},"type":"conference","doi":"10.1109/cvpr.2012.6247674","article_number":"6247674","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publisher":"IEEE"},{"author":[{"full_name":"Strecha, C.","first_name":"C.","last_name":"Strecha"},{"last_name":"Bronstein","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","full_name":"Bronstein, Alexander","orcid":"0000-0001-9699-8730","first_name":"Alexander"},{"full_name":"Bronstein, M. M.","first_name":"M. M.","last_name":"Bronstein"},{"full_name":"Fua, P.","first_name":"P.","last_name":"Fua"}],"publication_status":"published","article_type":"original","month":"01","intvolume":"        34","issue":"1","oa_version":"None","year":"2012","article_processing_charge":"No","date_created":"2024-10-15T11:20:54Z","scopus_import":"1","publication":"IEEE Transactions on Pattern Analysis and Machine Intelligence","citation":{"apa":"Strecha, C., Bronstein, A. M., Bronstein, M. M., &#38; Fua, P. (2012). LDAHash: Improved matching with smaller descriptors. <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. Institute of Electrical and Electronics Engineers. <a href=\"https://doi.org/10.1109/tpami.2011.103\">https://doi.org/10.1109/tpami.2011.103</a>","ieee":"C. Strecha, A. M. Bronstein, M. M. Bronstein, and P. Fua, “LDAHash: Improved matching with smaller descriptors,” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>, vol. 34, no. 1. Institute of Electrical and Electronics Engineers, pp. 66–78, 2012.","short":"C. Strecha, A.M. Bronstein, M.M. Bronstein, P. Fua, IEEE Transactions on Pattern Analysis and Machine Intelligence 34 (2012) 66–78.","chicago":"Strecha, C., Alex M. Bronstein, M. M. Bronstein, and P. Fua. “LDAHash: Improved Matching with Smaller Descriptors.” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. Institute of Electrical and Electronics Engineers, 2012. <a href=\"https://doi.org/10.1109/tpami.2011.103\">https://doi.org/10.1109/tpami.2011.103</a>.","ista":"Strecha C, Bronstein AM, Bronstein MM, Fua P. 2012. LDAHash: Improved matching with smaller descriptors. IEEE Transactions on Pattern Analysis and Machine Intelligence. 34(1), 66–78.","mla":"Strecha, C., et al. “LDAHash: Improved Matching with Smaller Descriptors.” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>, vol. 34, no. 1, Institute of Electrical and Electronics Engineers, 2012, pp. 66–78, doi:<a href=\"https://doi.org/10.1109/tpami.2011.103\">10.1109/tpami.2011.103</a>.","ama":"Strecha C, Bronstein AM, Bronstein MM, Fua P. LDAHash: Improved matching with smaller descriptors. <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. 2012;34(1):66-78. doi:<a href=\"https://doi.org/10.1109/tpami.2011.103\">10.1109/tpami.2011.103</a>"},"extern":"1","publication_identifier":{"issn":["0162-8828"],"eissn":["2160-9292"]},"volume":34,"quality_controlled":"1","date_published":"2012-01-01T00:00:00Z","day":"01","external_id":{"pmid":["21576750 "]},"language":[{"iso":"eng"}],"fulldoi":"https://doi.org/10.1109/tpami.2011.103","title":"LDAHash: Improved matching with smaller descriptors","abstract":[{"text":"SIFT-like local feature descriptors are ubiquitously employed in computer vision applications such as content-based retrieval, video analysis, copy detection, object recognition, photo tourism, and 3D reconstruction. Feature descriptors can be designed to be invariant to certain classes of photometric and geometric transformations, in particular, affine and intensity scale transformations. However, real transformations that an image can undergo can only be approximately modeled in this way, and thus most descriptors are only approximately invariant in practice. Second, descriptors are usually high dimensional (e.g., SIFT is represented as a 128--dimensional vector). In large-scale retrieval and matching problems, this can pose challenges in storing and retrieving descriptor data. We map the descriptor vectors into the Hamming space in which the Hamming metric is used to compare the resulting representations. This way, we reduce the size of the descriptors by representing them as short binary strings and learn descriptor invariance from examples. We show extensive experimental validation, demonstrating the advantage of the proposed approach.","lang":"eng"}],"pmid":1,"page":"66-78","date_updated":"2024-11-12T08:34:48Z","_id":"18412","status":"public","type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Institute of Electrical and Electronics Engineers","doi":"10.1109/tpami.2011.103"},{"title":"On the mass-critical generalized KdV equation","abstract":[{"text":"We consider the mass-critical generalized Korteweg{de Vries equation (∂t + ∂xxx)u = ±∂ x(u 5) for real-valued functions u(t; x). We prove that if the global well-posedness and scattering conjecture for this equation failed, then, conditional on a positive answer to the global well-posedness and scattering conjecture for the masscritical nonlinear Schrffodinger equation (-i∂ t + ∂xx)u = ±(|u| 4u), there exists a minimal-mass blowup solution to the mass-critical generalized KdV equation which is almost periodic modulo the symmetries of the equation. Moreover, we can guarantee that this minimal-mass blowup solution is either a self-similar solution, a soliton-like solution, or a double high-to-low frequency cascade solution.","lang":"eng"}],"page":"191-221","date_updated":"2026-06-29T09:59:46Z","status":"public","_id":"22056","type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"American Institute of Mathematical Sciences","doi":"10.3934/dcds.2012.32.191","date_published":"2012-01-01T00:00:00Z","day":"01","external_id":{"arxiv":["0907.5412"]},"language":[{"iso":"eng"}],"fulldoi":"https://doi.org/10.3934/dcds.2012.32.191","das_tickbox":"1","date_created":"2026-06-19T07:57:09Z","scopus_import":"1","publication":"Discrete and Continuous Dynamical Systems","citation":{"mla":"Killip, Rowan, et al. “On the Mass-Critical Generalized KdV Equation.” <i>Discrete and Continuous Dynamical Systems</i>, vol. 32, no. 1, American Institute of Mathematical Sciences, 2012, pp. 191–221, doi:<a href=\"https://doi.org/10.3934/dcds.2012.32.191\">10.3934/dcds.2012.32.191</a>.","ama":"Killip R, Kwon S, Shao S, Vişan M. On the mass-critical generalized KdV equation. <i>Discrete and Continuous Dynamical Systems</i>. 2012;32(1):191-221. doi:<a href=\"https://doi.org/10.3934/dcds.2012.32.191\">10.3934/dcds.2012.32.191</a>","ista":"Killip R, Kwon S, Shao S, Vişan M. 2012. On the mass-critical generalized KdV equation. Discrete and Continuous Dynamical Systems. 32(1), 191–221.","chicago":"Killip, Rowan, Soonsik Kwon, Shuanglin Shao, and Monica Vişan. “On the Mass-Critical Generalized KdV Equation.” <i>Discrete and Continuous Dynamical Systems</i>. American Institute of Mathematical Sciences, 2012. <a href=\"https://doi.org/10.3934/dcds.2012.32.191\">https://doi.org/10.3934/dcds.2012.32.191</a>.","ieee":"R. Killip, S. Kwon, S. Shao, and M. Vişan, “On the mass-critical generalized KdV equation,” <i>Discrete and Continuous Dynamical Systems</i>, vol. 32, no. 1. American Institute of Mathematical Sciences, pp. 191–221, 2012.","apa":"Killip, R., Kwon, S., Shao, S., &#38; Vişan, M. (2012). On the mass-critical generalized KdV equation. <i>Discrete and Continuous Dynamical Systems</i>. American Institute of Mathematical Sciences. <a href=\"https://doi.org/10.3934/dcds.2012.32.191\">https://doi.org/10.3934/dcds.2012.32.191</a>","short":"R. Killip, S. Kwon, S. Shao, M. Vişan, Discrete and Continuous Dynamical Systems 32 (2012) 191–221."},"mathsc":["35Q53"],"extern":"1","volume":32,"publication_identifier":{"issn":["1078-0947"],"eissn":["1553-5231"]},"quality_controlled":"1","OA_place":"repository","arxiv":1,"OA_type":"green","author":[{"last_name":"Killip","first_name":"Rowan","full_name":"Killip, Rowan"},{"last_name":"Kwon","first_name":"Soonsik","full_name":"Kwon, Soonsik"},{"first_name":"Shuanglin","full_name":"Shao, Shuanglin","last_name":"Shao"},{"first_name":"Monica","full_name":"Visan, Monica","id":"056daca0-b8d1-11f0-964f-f91054abf8ca","last_name":"Visan"}],"publication_status":"published","article_type":"original","month":"01","oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.0907.5412"}],"issue":"1","intvolume":"        32","oa":1,"year":"2012","article_processing_charge":"No"},{"publisher":"Oxford University Press","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1093/imrn/rnr051","type":"journal_article","_id":"22075","status":"public","page":"1037-1067","date_updated":"2026-06-30T11:21:51Z","title":"Global well-posedness and scattering for the defocusing cubic nonlinear Schrödinger equation in four dimensions","abstract":[{"lang":"eng","text":"In this short note, we present a new proof of the global well-posedness and scattering result for the defocusing energy-critical nonlinear Schrödinger equation (NLS) in four space dimensions obtained previously by Ryckman and Visan [“Global well-posedness and scattering for the defocusing energycritical nonlinear Schrödinger equation in R^1+4⁠.” American Journal of Mathematics 129 (2007): 1–60. MR2288737]. The argument is inspired by the recent work of Dodson [“Global well-posedness and scattering for the defocusing, L2-critical, nonlinear Schrödinger equation when d≥3.” (2009): preprint arXiv:0912.2467.] on the mass-critical NLS."}],"external_id":{"arxiv":["1011.1526"]},"fulldoi":"https://doi.org/10.1093/imrn/rnr051","language":[{"iso":"eng"}],"date_published":"2012-05-01T00:00:00Z","day":"01","publication_identifier":{"issn":["1073-7928"],"eissn":["1687-0247"]},"volume":2012,"OA_type":"green","arxiv":1,"quality_controlled":"1","OA_place":"repository","citation":{"apa":"Vişan, M. (2012). Global well-posedness and scattering for the defocusing cubic nonlinear Schrödinger equation in four dimensions. <i>International Mathematics Research Notices</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/imrn/rnr051\">https://doi.org/10.1093/imrn/rnr051</a>","ieee":"M. Vişan, “Global well-posedness and scattering for the defocusing cubic nonlinear Schrödinger equation in four dimensions,” <i>International Mathematics Research Notices</i>, vol. 2012, no. 5. Oxford University Press, pp. 1037–1067, 2012.","short":"M. Vişan, International Mathematics Research Notices 2012 (2012) 1037–1067.","chicago":"Vişan, Monica. “Global Well-Posedness and Scattering for the Defocusing Cubic Nonlinear Schrödinger Equation in Four Dimensions.” <i>International Mathematics Research Notices</i>. Oxford University Press, 2012. <a href=\"https://doi.org/10.1093/imrn/rnr051\">https://doi.org/10.1093/imrn/rnr051</a>.","ista":"Vişan M. 2012. Global well-posedness and scattering for the defocusing cubic nonlinear Schrödinger equation in four dimensions. International Mathematics Research Notices. 2012(5), 1037–1067.","ama":"Vişan M. Global well-posedness and scattering for the defocusing cubic nonlinear Schrödinger equation in four dimensions. <i>International Mathematics Research Notices</i>. 2012;2012(5):1037-1067. doi:<a href=\"https://doi.org/10.1093/imrn/rnr051\">10.1093/imrn/rnr051</a>","mla":"Vişan, Monica. “Global Well-Posedness and Scattering for the Defocusing Cubic Nonlinear Schrödinger Equation in Four Dimensions.” <i>International Mathematics Research Notices</i>, vol. 2012, no. 5, Oxford University Press, 2012, pp. 1037–67, doi:<a href=\"https://doi.org/10.1093/imrn/rnr051\">10.1093/imrn/rnr051</a>."},"extern":"1","scopus_import":"1","das_tickbox":"1","date_created":"2026-06-19T08:23:13Z","publication":"International Mathematics Research Notices","article_processing_charge":"No","oa":1,"year":"2012","month":"05","oa_version":"Preprint","issue":"5","intvolume":"      2012","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.1011.1526","open_access":"1"}],"article_type":"original","publication_status":"published","author":[{"last_name":"Visan","first_name":"Monica","full_name":"Visan, Monica","id":"056daca0-b8d1-11f0-964f-f91054abf8ca"}]},{"type":"journal_article","status":"public","_id":"2318","publisher":"EMS Press","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.4171/JST/31","title":"Absence of bound states implies non-negativity of the scattering length","abstract":[{"text":"We show that bosons interacting via pair potentials with negative scattering length form bound states for a suitable number of particles. In other words, the absence of many-particle bound states of any kind implies the non-negativity of the scattering length of the interaction potential. ","lang":"eng"}],"date_updated":"2026-07-06T11:57:04Z","page":"321-328","day":"24","date_published":"2012-06-24T00:00:00Z","external_id":{"arxiv":["1204.0435"],"isi":["000209021900004"]},"publist_id":"4609","fulldoi":"https://doi.org/10.4171/JST/31","isi":1,"language":[{"iso":"eng"}],"volume":2,"quality_controlled":"1","arxiv":1,"acknowledgement":"Partial financial support by NSERC ","department":[{"_id":"RoSe"}],"date_created":"2018-12-11T11:56:58Z","das_tickbox":"1","publication":"Journal of Spectral Theory","corr_author":"1","citation":{"ista":"Seiringer R. 2012. Absence of bound states implies non-negativity of the scattering length. Journal of Spectral Theory. 2(3), 321–328.","mla":"Seiringer, Robert. “Absence of Bound States Implies Non-Negativity of the Scattering Length.” <i>Journal of Spectral Theory</i>, vol. 2, no. 3, EMS Press, 2012, pp. 321–28, doi:<a href=\"https://doi.org/10.4171/JST/31\">10.4171/JST/31</a>.","ama":"Seiringer R. Absence of bound states implies non-negativity of the scattering length. <i>Journal of Spectral Theory</i>. 2012;2(3):321-328. doi:<a href=\"https://doi.org/10.4171/JST/31\">10.4171/JST/31</a>","apa":"Seiringer, R. (2012). Absence of bound states implies non-negativity of the scattering length. <i>Journal of Spectral Theory</i>. EMS Press. <a href=\"https://doi.org/10.4171/JST/31\">https://doi.org/10.4171/JST/31</a>","ieee":"R. Seiringer, “Absence of bound states implies non-negativity of the scattering length,” <i>Journal of Spectral Theory</i>, vol. 2, no. 3. EMS Press, pp. 321–328, 2012.","short":"R. Seiringer, Journal of Spectral Theory 2 (2012) 321–328.","chicago":"Seiringer, Robert. “Absence of Bound States Implies Non-Negativity of the Scattering Length.” <i>Journal of Spectral Theory</i>. EMS Press, 2012. <a href=\"https://doi.org/10.4171/JST/31\">https://doi.org/10.4171/JST/31</a>."},"month":"06","oa_version":"Preprint","issue":"3","intvolume":"         2","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1204.0435"}],"article_processing_charge":"No","oa":1,"year":"2012","publication_status":"published","author":[{"id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6781-0521","full_name":"Seiringer, Robert","first_name":"Robert","last_name":"Seiringer"}]},{"project":[{"grant_number":"SFB-TR3-TP10B","_id":"25BDE9A4-B435-11E9-9278-68D0E5697425","name":"Glutamaterge synaptische Übertragung und Plastizität in hippocampalen Mikroschaltkreisen"}],"type":"journal_article","_id":"2954","status":"public","publisher":"Biophysical Society","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1016/j.bpj.2012.08.039","title":"A deconvolution based method with high sensitivity and temporal resolution for detection of spontaneous synaptic currents in vitro and in vivo","abstract":[{"lang":"eng","text":"Spontaneous postsynaptic currents (PSCs) provide key information about the mechanisms of synaptic transmission and the activity modes of neuronal networks. However, detecting spontaneous PSCs in vitro and in vivo has been challenging, because of the small amplitude, the variable kinetics, and the undefined time of generation of these events. Here, we describe a, to our knowledge, new method for detecting spontaneous synaptic events by deconvolution, using a template that approximates the average time course of spontaneous PSCs. A recorded PSC trace is deconvolved from the template, resulting in a series of delta-like functions. The maxima of these delta-like events are reliably detected, revealing the precise onset times of the spontaneous PSCs. Among all detection methods, the deconvolution-based method has a unique temporal resolution, allowing the detection of individual events in high-frequency bursts. Furthermore, the deconvolution-based method has a high amplitude resolution, because deconvolution can substantially increase the signal/noise ratio. When tested against previously published methods using experimental data, the deconvolution-based method was superior for spontaneous PSCs recorded in vivo. Using the high-resolution deconvolution-based detection algorithm, we show that the frequency of spontaneous excitatory postsynaptic currents in dentate gyrus granule cells is 4.5 times higher in vivo than in vitro."}],"pmid":1,"date_updated":"2026-07-06T12:32:51Z","page":"1429 - 1439","date_published":"2012-10-03T00:00:00Z","day":"03","external_id":{"pmid":["23062335"],"isi":["000309571400005"]},"publist_id":"3774","fulldoi":"https://doi.org/10.1016/j.bpj.2012.08.039","isi":1,"language":[{"iso":"eng"}],"volume":103,"quality_controlled":"1","acknowledgement":"This work was supported by the Deutsche Forschungsgemeinschaft (TR3/B10) and a European Research Council Advanced grant to P.J.\r\nWe thank H. Hu, S. J. Guzman, and C. Schmidt-Hieber for critically reading the manuscript, I. Koeva and F. Marr for technical support, and E. Kramberger for editorial assistance.\r\n","department":[{"_id":"PeJo"},{"_id":"ScienComp"}],"scopus_import":"1","date_created":"2018-12-11T12:00:32Z","das_tickbox":"1","publication":"Biophysical Journal","corr_author":"1","citation":{"chicago":"Pernia-Andrade, Alejandro, Sarit Goswami, Yvonne Stickler, Ulrich Fröbe, Alois Schlögl, and Peter M Jonas. “A Deconvolution Based Method with High Sensitivity and Temporal Resolution for Detection of Spontaneous Synaptic Currents in Vitro and in Vivo.” <i>Biophysical Journal</i>. Biophysical Society, 2012. <a href=\"https://doi.org/10.1016/j.bpj.2012.08.039\">https://doi.org/10.1016/j.bpj.2012.08.039</a>.","ieee":"A. Pernia-Andrade, S. Goswami, Y. Stickler, U. Fröbe, A. Schlögl, and P. M. Jonas, “A deconvolution based method with high sensitivity and temporal resolution for detection of spontaneous synaptic currents in vitro and in vivo,” <i>Biophysical Journal</i>, vol. 103, no. 7. Biophysical Society, pp. 1429–1439, 2012.","apa":"Pernia-Andrade, A., Goswami, S., Stickler, Y., Fröbe, U., Schlögl, A., &#38; Jonas, P. M. (2012). A deconvolution based method with high sensitivity and temporal resolution for detection of spontaneous synaptic currents in vitro and in vivo. <i>Biophysical Journal</i>. Biophysical Society. <a href=\"https://doi.org/10.1016/j.bpj.2012.08.039\">https://doi.org/10.1016/j.bpj.2012.08.039</a>","short":"A. Pernia-Andrade, S. Goswami, Y. Stickler, U. Fröbe, A. Schlögl, P.M. Jonas, Biophysical Journal 103 (2012) 1429–1439.","mla":"Pernia-Andrade, Alejandro, et al. “A Deconvolution Based Method with High Sensitivity and Temporal Resolution for Detection of Spontaneous Synaptic Currents in Vitro and in Vivo.” <i>Biophysical Journal</i>, vol. 103, no. 7, Biophysical Society, 2012, pp. 1429–39, doi:<a href=\"https://doi.org/10.1016/j.bpj.2012.08.039\">10.1016/j.bpj.2012.08.039</a>.","ama":"Pernia-Andrade A, Goswami S, Stickler Y, Fröbe U, Schlögl A, Jonas PM. A deconvolution based method with high sensitivity and temporal resolution for detection of spontaneous synaptic currents in vitro and in vivo. <i>Biophysical Journal</i>. 2012;103(7):1429-1439. doi:<a href=\"https://doi.org/10.1016/j.bpj.2012.08.039\">10.1016/j.bpj.2012.08.039</a>","ista":"Pernia-Andrade A, Goswami S, Stickler Y, Fröbe U, Schlögl A, Jonas PM. 2012. A deconvolution based method with high sensitivity and temporal resolution for detection of spontaneous synaptic currents in vitro and in vivo. Biophysical Journal. 103(7), 1429–1439."},"month":"10","oa_version":"Submitted Version","main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3471482/","open_access":"1"}],"intvolume":"       103","issue":"7","article_processing_charge":"No","oa":1,"year":"2012","publication_status":"published","author":[{"first_name":"Alejandro","full_name":"Pernia-Andrade, Alejandro","id":"36963E98-F248-11E8-B48F-1D18A9856A87","last_name":"Pernia-Andrade"},{"id":"3A578F32-F248-11E8-B48F-1D18A9856A87","first_name":"Sarit","full_name":"Goswami, Sarit","last_name":"Goswami"},{"last_name":"Stickler","id":"63B76600-E9CC-11E9-9B5F-82450873F7A1","first_name":"Yvonne","full_name":"Stickler, Yvonne"},{"last_name":"Fröbe","full_name":"Fröbe, Ulrich","first_name":"Ulrich"},{"last_name":"Schlögl","id":"45BF87EE-F248-11E8-B48F-1D18A9856A87","first_name":"Alois","orcid":"0000-0002-5621-8100","full_name":"Schlögl, Alois"},{"last_name":"Jonas","orcid":"0000-0001-5001-4804","full_name":"Jonas, Peter M","first_name":"Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87"}]},{"corr_author":"1","citation":{"mla":"Pantazis, Periklis, and Mark Tobias Bollenbach. “Transcription Factor Kinetics and the Emerging Asymmetry in the Early Mammalian Embryo.” <i>Cell Cycle</i>, vol. 11, no. 11, Taylor &#38; Francis, 2012, pp. 2055–58, doi:<a href=\"https://doi.org/10.4161/cc.20118\">10.4161/cc.20118</a>.","ama":"Pantazis P, Bollenbach MT. Transcription factor kinetics and the emerging asymmetry in the early mammalian embryo. <i>Cell Cycle</i>. 2012;11(11):2055-2058. doi:<a href=\"https://doi.org/10.4161/cc.20118\">10.4161/cc.20118</a>","ista":"Pantazis P, Bollenbach MT. 2012. Transcription factor kinetics and the emerging asymmetry in the early mammalian embryo. Cell Cycle. 11(11), 2055–2058.","chicago":"Pantazis, Periklis, and Mark Tobias Bollenbach. “Transcription Factor Kinetics and the Emerging Asymmetry in the Early Mammalian Embryo.” <i>Cell Cycle</i>. Taylor &#38; Francis, 2012. <a href=\"https://doi.org/10.4161/cc.20118\">https://doi.org/10.4161/cc.20118</a>.","apa":"Pantazis, P., &#38; Bollenbach, M. T. (2012). Transcription factor kinetics and the emerging asymmetry in the early mammalian embryo. <i>Cell Cycle</i>. Taylor &#38; Francis. <a href=\"https://doi.org/10.4161/cc.20118\">https://doi.org/10.4161/cc.20118</a>","ieee":"P. Pantazis and M. T. Bollenbach, “Transcription factor kinetics and the emerging asymmetry in the early mammalian embryo,” <i>Cell Cycle</i>, vol. 11, no. 11. Taylor &#38; Francis, pp. 2055–2058, 2012.","short":"P. Pantazis, M.T. Bollenbach, Cell Cycle 11 (2012) 2055–2058."},"publication":"Cell Cycle","department":[{"_id":"ToBo"}],"scopus_import":"1","date_created":"2018-12-11T12:01:44Z","das_tickbox":"1","quality_controlled":"1","volume":11,"publication_status":"published","author":[{"first_name":"Periklis","full_name":"Pantazis, Periklis","last_name":"Pantazis"},{"last_name":"Bollenbach","id":"3E6DB97A-F248-11E8-B48F-1D18A9856A87","full_name":"Bollenbach, Tobias","orcid":"0000-0003-4398-476X","first_name":"Tobias"}],"article_processing_charge":"No","year":"2012","issue":"11","oa_version":"None","intvolume":"        11","month":"06","page":"2055 - 2058","date_updated":"2026-07-07T05:34:50Z","abstract":[{"lang":"eng","text":"There is a long-running controversy about how early cell fate decisions are made in the developing mammalian embryo. 1,2 In particular, it is controversial when the first events that can predict the establishment of the pluripotent and extra-embryonic lineages in the blastocyst of the pre-implantation embryo occur. It has long been proposed that the position and polarity of cells at the 16- to 32-cell stage embryo influence their decision to either give rise to the pluripotent cell lineage that eventually contributes to the inner cell mass (ICM), comprising the primitive endoderm (PE) and the epiblast (EPI), or the extra-embryonic trophectoderm (TE) surrounding the blastocoel. The positioning of cells in the embryo at this developmental stage could largely be the result of random events, making this a stochastic model of cell lineage allocation. Contrary to such a stochastic model, some studies have detected putative differences in the lineage potential of individual blastomeres before compaction, indicating that the first cell fate decisions may occur as early as at the 4-cell stage. Using a non-invasive, quantitative in vivo imaging assay to study the kinetic behavior of Oct4 (also known as POU5F1), a key transcription factor (TF) controlling pre-implantation development in the mouse embryo, 3-5 a recent study identifies Oct4 kinetics as a predictive measure of cell lineage patterning in the early mouse embryo. 6 Here, we discuss the implications of such molecular heterogeneities in early development and offer potential avenues toward a mechanistic understanding of these observations, contributing to the resolution of the controversy of developmental cell lineage allocation."}],"title":"Transcription factor kinetics and the emerging asymmetry in the early mammalian embryo","doi":"10.4161/cc.20118","publisher":"Taylor & Francis","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","_id":"3160","status":"public","publist_id":"3531","fulldoi":"https://doi.org/10.4161/cc.20118","isi":1,"language":[{"iso":"eng"}],"external_id":{"isi":["000304770100011"]},"date_published":"2012-06-01T00:00:00Z","day":"01"},{"day":"01","date_published":"2012-09-01T00:00:00Z","publist_id":"5003","fulldoi":"https://doi.org/10.1007/978-3-642-33027-8_13","language":[{"iso":"eng"}],"title":"Practical leakage-resilient symmetric cryptography","conference":{"end_date":"2012-09-12","location":"Leuven, Belgium","start_date":"2012-09-09","name":"CHES: Cryptographic Hardware and Embedded Systems"},"abstract":[{"lang":"eng","text":"Leakage resilient cryptography attempts to incorporate side-channel leakage into the black-box security model and designs cryptographic schemes that are provably secure within it. Informally, a scheme is leakage-resilient if it remains secure even if an adversary learns a bounded amount of arbitrary information about the schemes internal state. Unfortunately, most leakage resilient schemes are unnecessarily complicated in order to achieve strong provable security guarantees. As advocated by Yu et al. [CCS’10], this mostly is an artefact of the security proof and in practice much simpler construction may already suffice to protect against realistic side-channel attacks. In this paper, we show that indeed for simpler constructions leakage-resilience can be obtained when we aim for relaxed security notions where the leakage-functions and/or the inputs to the primitive are chosen non-adaptively. For example, we show that a three round Feistel network instantiated with a leakage resilient PRF yields a leakage resilient PRP if the inputs are chosen non-adaptively (This complements the result of Dodis and Pietrzak [CRYPTO’10] who show that if a adaptive queries are allowed, a superlogarithmic number of rounds is necessary.) We also show that a minor variation of the classical GGM construction gives a leakage resilient PRF if both, the leakage-function and the inputs, are chosen non-adaptively."}],"date_updated":"2026-07-07T13:05:30Z","page":"213 - 232","type":"conference","project":[{"grant_number":"259668","name":"Provable Security for Physical Cryptography","call_identifier":"FP7","_id":"258C570E-B435-11E9-9278-68D0E5697425"}],"_id":"2048","status":"public","publisher":"Springer","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1007/978-3-642-33027-8_13","publication_status":"published","author":[{"full_name":"Faust, Sebastian","first_name":"Sebastian","last_name":"Faust"},{"last_name":"Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z","first_name":"Krzysztof Z"},{"full_name":"Schipper, Joachim","first_name":"Joachim","id":"7BE863D4-E9CF-11E9-9EDB-90527418172C","last_name":"Schipper"}],"month":"09","main_file_link":[{"open_access":"1","url":"http://www.iacr.org/archive/ches2012/74280211/74280211.pdf"}],"intvolume":"      7428","oa_version":"Preprint","article_processing_charge":"No","year":"2012","oa":1,"scopus_import":"1","department":[{"_id":"KrPi"}],"date_created":"2018-12-11T11:55:25Z","das_tickbox":"1","publication":"Conference proceedings CHES 2012","citation":{"ista":"Faust S, Pietrzak KZ, Schipper J. 2012. Practical leakage-resilient symmetric cryptography. Conference proceedings CHES 2012. CHES: Cryptographic Hardware and Embedded Systems, LNCS, vol. 7428, 213–232.","ama":"Faust S, Pietrzak KZ, Schipper J. Practical leakage-resilient symmetric cryptography. In: <i>Conference Proceedings CHES 2012</i>. Vol 7428. Springer; 2012:213-232. doi:<a href=\"https://doi.org/10.1007/978-3-642-33027-8_13\">10.1007/978-3-642-33027-8_13</a>","mla":"Faust, Sebastian, et al. “Practical Leakage-Resilient Symmetric Cryptography.” <i>Conference Proceedings CHES 2012</i>, vol. 7428, Springer, 2012, pp. 213–32, doi:<a href=\"https://doi.org/10.1007/978-3-642-33027-8_13\">10.1007/978-3-642-33027-8_13</a>.","short":"S. Faust, K.Z. Pietrzak, J. Schipper, in:, Conference Proceedings CHES 2012, Springer, 2012, pp. 213–232.","ieee":"S. Faust, K. Z. Pietrzak, and J. Schipper, “Practical leakage-resilient symmetric cryptography,” in <i>Conference proceedings CHES 2012</i>, Leuven, Belgium, 2012, vol. 7428, pp. 213–232.","apa":"Faust, S., Pietrzak, K. Z., &#38; Schipper, J. (2012). Practical leakage-resilient symmetric cryptography. In <i>Conference proceedings CHES 2012</i> (Vol. 7428, pp. 213–232). Leuven, Belgium: Springer. <a href=\"https://doi.org/10.1007/978-3-642-33027-8_13\">https://doi.org/10.1007/978-3-642-33027-8_13</a>","chicago":"Faust, Sebastian, Krzysztof Z Pietrzak, and Joachim Schipper. “Practical Leakage-Resilient Symmetric Cryptography.” In <i>Conference Proceedings CHES 2012</i>, 7428:213–32. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-33027-8_13\">https://doi.org/10.1007/978-3-642-33027-8_13</a>."},"alternative_title":["LNCS"],"volume":7428,"ec_funded":1,"quality_controlled":"1","acknowledgement":"Sebastian Faust acknowledges support from the Danish National Research Foundation and The National Science Foundation of China (under the grant 61061130540) for the Sino-Danish Center for the Theory of Interactive Computation, within part of this work was performed; and from the CFEM research center, supported by the Danish Strategic Research Council. \r\nSupported by the European Research Council/ERC Starting Grant 259668-PSPC.\r\n"},{"publication_status":"published","author":[{"last_name":"Heyse","first_name":"Stefan","full_name":"Heyse, Stefan"},{"last_name":"Kiltz","full_name":"Kiltz, Eike","first_name":"Eike"},{"full_name":"Lyubashevsky, Vadim","first_name":"Vadim","last_name":"Lyubashevsky"},{"last_name":"Paar","full_name":"Paar, Christof","first_name":"Christof"},{"first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak"}],"month":"03","oa_version":"Preprint","main_file_link":[{"url":"http://www.iacr.org/archive/fse2012/75490350/75490350.pdf","open_access":"1"}],"intvolume":"      7549","article_processing_charge":"No","year":"2012","oa":1,"scopus_import":"1","department":[{"_id":"KrPi"}],"das_tickbox":"1","date_created":"2018-12-11T11:55:25Z","publication":"Conference proceedings FSE 2012","citation":{"chicago":"Heyse, Stefan, Eike Kiltz, Vadim Lyubashevsky, Christof Paar, and Krzysztof Z Pietrzak. “Lapin: An Efficient Authentication Protocol Based on Ring-LPN.” In <i>Conference Proceedings FSE 2012</i>, 7549:346–65. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-34047-5_20\">https://doi.org/10.1007/978-3-642-34047-5_20</a>.","ieee":"S. Heyse, E. Kiltz, V. Lyubashevsky, C. Paar, and K. Z. Pietrzak, “Lapin: An efficient authentication protocol based on ring-LPN,” in <i>Conference proceedings FSE 2012</i>, Washington, DC, USA, 2012, vol. 7549, pp. 346–365.","apa":"Heyse, S., Kiltz, E., Lyubashevsky, V., Paar, C., &#38; Pietrzak, K. Z. (2012). Lapin: An efficient authentication protocol based on ring-LPN. In <i>Conference proceedings FSE 2012</i> (Vol. 7549, pp. 346–365). Washington, DC, USA: Springer. <a href=\"https://doi.org/10.1007/978-3-642-34047-5_20\">https://doi.org/10.1007/978-3-642-34047-5_20</a>","short":"S. Heyse, E. Kiltz, V. Lyubashevsky, C. Paar, K.Z. Pietrzak, in:, Conference Proceedings FSE 2012, Springer, 2012, pp. 346–365.","ama":"Heyse S, Kiltz E, Lyubashevsky V, Paar C, Pietrzak KZ. Lapin: An efficient authentication protocol based on ring-LPN. In: <i>Conference Proceedings FSE 2012</i>. Vol 7549. Springer; 2012:346-365. doi:<a href=\"https://doi.org/10.1007/978-3-642-34047-5_20\">10.1007/978-3-642-34047-5_20</a>","mla":"Heyse, Stefan, et al. “Lapin: An Efficient Authentication Protocol Based on Ring-LPN.” <i>Conference Proceedings FSE 2012</i>, vol. 7549, Springer, 2012, pp. 346–65, doi:<a href=\"https://doi.org/10.1007/978-3-642-34047-5_20\">10.1007/978-3-642-34047-5_20</a>.","ista":"Heyse S, Kiltz E, Lyubashevsky V, Paar C, Pietrzak KZ. 2012. Lapin: An efficient authentication protocol based on ring-LPN. Conference proceedings FSE 2012. FSE: Fast Software Encryption, LNCS, vol. 7549, 346–365."},"alternative_title":["LNCS"],"ec_funded":1,"volume":7549,"quality_controlled":"1","acknowledgement":"Supported by the European Research Council / ERC Starting Grant (259668- PSPC)\r\nWe would like to thank the anonymous referees of this confer- ence and those of the ECRYPT Workshop on Lightweight Cryptography for very useful comments, and in particular for the suggestion that the scheme is somewhat vulnerable to a man-in-the-middle attack whenever an adversary observes two reader challenges that are the same. We hope that the attack we described in Appendix A corresponds to what the reviewer had in mind. We also thank Tanja Lange for pointing us to the pa- per of [Kir11] and for discussions of some of her recent work. ","day":"01","date_published":"2012-03-01T00:00:00Z","publist_id":"5002","fulldoi":"https://doi.org/10.1007/978-3-642-34047-5_20","language":[{"iso":"eng"}],"title":"Lapin: An efficient authentication protocol based on ring-LPN","conference":{"end_date":"2012-03-21","name":"FSE: Fast Software Encryption","location":"Washington, DC, USA","start_date":"2012-03-19"},"abstract":[{"text":"We propose a new authentication protocol that is provably secure based on a ring variant of the learning parity with noise (LPN) problem. The protocol follows the design principle of the LPN-based protocol from Eurocrypt’11 (Kiltz et al.), and like it, is a two round protocol secure against active attacks. Moreover, our protocol has small communication complexity and a very small footprint which makes it applicable in scenarios that involve low-cost, resource-constrained devices.\r\n\r\nPerformance-wise, our protocol is more efficient than previous LPN-based schemes, such as the many variants of the Hopper-Blum (HB) protocol and the aforementioned protocol from Eurocrypt’11. Our implementation results show that it is even comparable to the standard challenge-and-response protocols based on the AES block-cipher. Our basic protocol is roughly 20 times slower than AES, but with the advantage of having 10 times smaller code size. Furthermore, if a few hundred bytes of non-volatile memory are available to allow the storage of some off-line pre-computations, then the online phase of our protocols is only twice as slow as AES.\r\n","lang":"eng"}],"date_updated":"2026-07-07T13:06:19Z","page":"346 - 365","type":"conference","project":[{"name":"Provable Security for Physical Cryptography","call_identifier":"FP7","_id":"258C570E-B435-11E9-9278-68D0E5697425","grant_number":"259668"}],"_id":"2049","status":"public","publisher":"Springer","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1007/978-3-642-34047-5_20"},{"day":"16","date_published":"2012-09-16T00:00:00Z","publist_id":"3791","fulldoi":"https://doi.org/10.1007/978-3-642-34059-8_20","language":[{"iso":"eng"}],"project":[{"grant_number":"267989","call_identifier":"FP7","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"}],"type":"conference","status":"public","_id":"2942","publisher":"Springer","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1007/978-3-642-34059-8_20","title":"Independent implementability of viewpoints","conference":{"name":"Monterey Workshop 2012","start_date":"2012-03-19","location":"Oxford, UK","end_date":"2012-03-21"},"abstract":[{"lang":"eng","text":"Interface theories provide a formal framework for component-based development of software and hardware which supports the incremental design of systems and the independent implementability of components. These capabilities are ensured through mathematical properties of the parallel composition operator and the refinement relation for components. More recently, a conjunction operation was added to interface theories in order to provide support for handling multiple viewpoints, requirements engineering, and component reuse. Unfortunately, the conjunction operator does not allow independent implementability in general. In this paper, we study conditions that need to be imposed on interface models in order to enforce independent implementability with respect to conjunction. We focus on multiple viewpoint specifications and propose a new compatibility criterion between two interfaces, which we call orthogonality. We show that orthogonal interfaces can be refined separately, while preserving both orthogonality and composability with other interfaces. We illustrate the independent implementability of different viewpoints with a FIFO buffer example."}],"date_updated":"2026-07-07T13:08:58Z","page":"380 - 395","month":"09","oa_version":"None","intvolume":"      7539","article_processing_charge":"No","year":"2012","publication_status":"published","author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger"},{"full_name":"Nickovic, Dejan","first_name":"Dejan","id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87","last_name":"Nickovic"}],"ec_funded":1,"volume":7539,"quality_controlled":"1","acknowledgement":"ERC Advanced Grant QUAREM (Quantitative Reactive Modeling), FWF National Research Network RISE (Rigorous Systems Engineering)","department":[{"_id":"ToHe"}],"scopus_import":"1","das_tickbox":"1","date_created":"2018-12-11T12:00:28Z","publication":"Conference proceedings Monterey Workshop 2012","citation":{"ama":"Henzinger TA, Nickovic D. Independent implementability of viewpoints. In: <i>Conference Proceedings Monterey Workshop 2012</i>. Vol 7539. Springer; 2012:380-395. doi:<a href=\"https://doi.org/10.1007/978-3-642-34059-8_20\">10.1007/978-3-642-34059-8_20</a>","mla":"Henzinger, Thomas A., and Dejan Nickovic. “Independent Implementability of Viewpoints.” <i>Conference Proceedings Monterey Workshop 2012</i>, vol. 7539, Springer, 2012, pp. 380–95, doi:<a href=\"https://doi.org/10.1007/978-3-642-34059-8_20\">10.1007/978-3-642-34059-8_20</a>.","ista":"Henzinger TA, Nickovic D. 2012. Independent implementability of viewpoints. Conference proceedings Monterey Workshop 2012. Monterey Workshop 2012, LNCS, vol. 7539, 380–395.","chicago":"Henzinger, Thomas A, and Dejan Nickovic. “Independent Implementability of Viewpoints.” In <i>Conference Proceedings Monterey Workshop 2012</i>, 7539:380–95. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-34059-8_20\">https://doi.org/10.1007/978-3-642-34059-8_20</a>.","ieee":"T. A. Henzinger and D. Nickovic, “Independent implementability of viewpoints,” in <i>Conference proceedings Monterey Workshop 2012</i>, Oxford, UK, 2012, vol. 7539, pp. 380–395.","apa":"Henzinger, T. A., &#38; Nickovic, D. (2012). Independent implementability of viewpoints. In <i>Conference proceedings Monterey Workshop 2012</i> (Vol. 7539, pp. 380–395). Oxford, UK: Springer. <a href=\"https://doi.org/10.1007/978-3-642-34059-8_20\">https://doi.org/10.1007/978-3-642-34059-8_20</a>","short":"T.A. Henzinger, D. Nickovic, in:, Conference Proceedings Monterey Workshop 2012, Springer, 2012, pp. 380–395."},"alternative_title":["LNCS"]},{"acknowledgement":"This work was supported by the Austrian Federal Ministry of Transport, Innovation and Technology under the Grant Bmvit-isb2 and the FFG under the project Pr. Nr. 809089.","quality_controlled":"1","volume":36,"corr_author":"1","citation":{"short":"G. Rieckh, W. Kreuzer, H. Waubke, P. Balazs, Engineering Analysis with Boundary Elements 36 (2012) 960–967.","apa":"Rieckh, G., Kreuzer, W., Waubke, H., &#38; Balazs, P. (2012). A 2.5D-Fourier-BEM model for vibrations in a tunnel running through layered anisotropic soil. <i>Engineering Analysis with Boundary Elements</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.enganabound.2011.12.014\">https://doi.org/10.1016/j.enganabound.2011.12.014</a>","ieee":"G. Rieckh, W. Kreuzer, H. Waubke, and P. Balazs, “A 2.5D-Fourier-BEM model for vibrations in a tunnel running through layered anisotropic soil,” <i>Engineering Analysis with Boundary Elements</i>, vol. 36, no. 6. Elsevier, pp. 960–967, 2012.","chicago":"Rieckh, Georg, Wolfgang Kreuzer, Holger Waubke, and Peter Balazs. “A 2.5D-Fourier-BEM Model for Vibrations in a Tunnel Running through Layered Anisotropic Soil.” <i>Engineering Analysis with Boundary Elements</i>. Elsevier, 2012. <a href=\"https://doi.org/10.1016/j.enganabound.2011.12.014\">https://doi.org/10.1016/j.enganabound.2011.12.014</a>.","ista":"Rieckh G, Kreuzer W, Waubke H, Balazs P. 2012. A 2.5D-Fourier-BEM model for vibrations in a tunnel running through layered anisotropic soil. Engineering Analysis with Boundary Elements. 36(6), 960–967.","ama":"Rieckh G, Kreuzer W, Waubke H, Balazs P. A 2.5D-Fourier-BEM model for vibrations in a tunnel running through layered anisotropic soil. <i>Engineering Analysis with Boundary Elements</i>. 2012;36(6):960-967. doi:<a href=\"https://doi.org/10.1016/j.enganabound.2011.12.014\">10.1016/j.enganabound.2011.12.014</a>","mla":"Rieckh, Georg, et al. “A 2.5D-Fourier-BEM Model for Vibrations in a Tunnel Running through Layered Anisotropic Soil.” <i>Engineering Analysis with Boundary Elements</i>, vol. 36, no. 6, Elsevier, 2012, pp. 960–67, doi:<a href=\"https://doi.org/10.1016/j.enganabound.2011.12.014\">10.1016/j.enganabound.2011.12.014</a>."},"publication":"Engineering Analysis with Boundary Elements","department":[{"_id":"GaTk"}],"scopus_import":"1","date_created":"2018-12-11T12:02:24Z","das_tickbox":"1","article_processing_charge":"No","year":"2012","issue":"6","intvolume":"        36","oa_version":"None","month":"06","publication_status":"published","author":[{"last_name":"Rieckh","full_name":"Rieckh, Georg","first_name":"Georg","id":"34DA8BD6-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Wolfgang","full_name":"Kreuzer, Wolfgang","last_name":"Kreuzer"},{"first_name":"Holger","full_name":"Waubke, Holger","last_name":"Waubke"},{"full_name":"Balazs, Peter","first_name":"Peter","last_name":"Balazs"}],"doi":"10.1016/j.enganabound.2011.12.014","publisher":"Elsevier","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","status":"public","_id":"3274","date_updated":"2026-07-07T13:10:10Z","page":"960 - 967","abstract":[{"lang":"eng","text":"A boundary element model of a tunnel running through horizontally layered soil with anisotropic material properties is presented. Since there is no analytical fundamental solution for wave propagation inside a layered orthotropic medium in 3D, the fundamental displacements and stresses have to be calculated numerically. In our model this is done in the Fourier domain with respect to space and time. The assumption of a straight tunnel with infinite extension in the x direction makes it possible to decouple the system for every wave number kx, leading to a 2.5D-problem, which is suited for parallel computation. The special form of the fundamental solution, resulting from our Fourier ansatz, and the fact, that the calculation of the boundary integral equation is performed in the Fourier domain, enhances the stability and efficiency of the numerical calculations."}],"title":"A 2.5D-Fourier-BEM model for vibrations in a tunnel running through layered anisotropic soil","isi":1,"fulldoi":"https://doi.org/10.1016/j.enganabound.2011.12.014","publist_id":"3372","language":[{"iso":"eng"}],"external_id":{"isi":["000301691600005"]},"day":"01","date_published":"2012-06-01T00:00:00Z"},{"day":"01","date_published":"2012-03-01T00:00:00Z","language":[{"iso":"eng"}],"isi":1,"fulldoi":"https://doi.org/10.1016/j.jsc.2011.11.001","publist_id":"3303","external_id":{"arxiv":["1104.1510"],"isi":["000300115300002"]},"abstract":[{"lang":"eng","text":"Computing the topology of an algebraic plane curve C means computing a combinatorial graph that is isotopic to C and thus represents its topology in R2. We prove that, for a polynomial of degree n with integer coefficients bounded by 2ρ, the topology of the induced curve can be computed with  bit operations ( indicates that we omit logarithmic factors). Our analysis improves the previous best known complexity bounds by a factor of n2. The improvement is based on new techniques to compute and refine isolating intervals for the real roots of polynomials, and on the consequent amortized analysis of the critical fibers of the algebraic curve."}],"title":"A worst case bound for topology computation of algebraic curves","date_updated":"2026-07-07T13:11:38Z","page":"239 - 258","status":"public","_id":"3331","type":"journal_article","doi":"10.1016/j.jsc.2011.11.001","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Elsevier","author":[{"first_name":"Michael","orcid":"0000-0002-8030-9299","full_name":"Kerber, Michael","id":"36E4574A-F248-11E8-B48F-1D18A9856A87","last_name":"Kerber"},{"last_name":"Sagraloff","first_name":"Michael","full_name":"Sagraloff, Michael"}],"publication_status":"published","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1104.1510"}],"oa_version":"Preprint","issue":"3","intvolume":"        47","month":"03","year":"2012","oa":1,"article_processing_charge":"No","publication":"Journal of Symbolic Computation","das_tickbox":"1","date_created":"2018-12-11T12:02:43Z","department":[{"_id":"HeEd"}],"scopus_import":"1","citation":{"ieee":"M. Kerber and M. Sagraloff, “A worst case bound for topology computation of algebraic curves,” <i>Journal of Symbolic Computation</i>, vol. 47, no. 3. Elsevier, pp. 239–258, 2012.","apa":"Kerber, M., &#38; Sagraloff, M. (2012). A worst case bound for topology computation of algebraic curves. <i>Journal of Symbolic Computation</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jsc.2011.11.001\">https://doi.org/10.1016/j.jsc.2011.11.001</a>","short":"M. Kerber, M. Sagraloff, Journal of Symbolic Computation 47 (2012) 239–258.","chicago":"Kerber, Michael, and Michael Sagraloff. “A Worst Case Bound for Topology Computation of Algebraic Curves.” <i>Journal of Symbolic Computation</i>. Elsevier, 2012. <a href=\"https://doi.org/10.1016/j.jsc.2011.11.001\">https://doi.org/10.1016/j.jsc.2011.11.001</a>.","ista":"Kerber M, Sagraloff M. 2012. A worst case bound for topology computation of algebraic curves. Journal of Symbolic Computation. 47(3), 239–258.","ama":"Kerber M, Sagraloff M. A worst case bound for topology computation of algebraic curves. <i>Journal of Symbolic Computation</i>. 2012;47(3):239-258. doi:<a href=\"https://doi.org/10.1016/j.jsc.2011.11.001\">10.1016/j.jsc.2011.11.001</a>","mla":"Kerber, Michael, and Michael Sagraloff. “A Worst Case Bound for Topology Computation of Algebraic Curves.” <i>Journal of Symbolic Computation</i>, vol. 47, no. 3, Elsevier, 2012, pp. 239–58, doi:<a href=\"https://doi.org/10.1016/j.jsc.2011.11.001\">10.1016/j.jsc.2011.11.001</a>."},"corr_author":"1","quality_controlled":"1","arxiv":1,"volume":47},{"publication_status":"published","author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Doyen","full_name":"Doyen, Laurent","first_name":"Laurent"}],"article_processing_charge":"No","oa":1,"year":"2012","month":"08","oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1107.2141"}],"citation":{"mla":"Chatterjee, Krishnendu, and Laurent Doyen. “Partial-Observation Stochastic Games: How to Win When Belief Fails.” <i>Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science</i>, 6280436, IEEE, 2012, doi:<a href=\"https://doi.org/10.1109/LICS.2012.28\">10.1109/LICS.2012.28</a>.","ama":"Chatterjee K, Doyen L. Partial-observation stochastic games: How to win when belief fails. In: <i>Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science</i>. IEEE; 2012. doi:<a href=\"https://doi.org/10.1109/LICS.2012.28\">10.1109/LICS.2012.28</a>","ista":"Chatterjee K, Doyen L. 2012. Partial-observation stochastic games: How to win when belief fails. Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, 6280436.","chicago":"Chatterjee, Krishnendu, and Laurent Doyen. “Partial-Observation Stochastic Games: How to Win When Belief Fails.” In <i>Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science</i>. IEEE, 2012. <a href=\"https://doi.org/10.1109/LICS.2012.28\">https://doi.org/10.1109/LICS.2012.28</a>.","short":"K. Chatterjee, L. Doyen, in:, Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2012.","apa":"Chatterjee, K., &#38; Doyen, L. (2012). Partial-observation stochastic games: How to win when belief fails. In <i>Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science</i>. Dubrovnik, Croatia: IEEE. <a href=\"https://doi.org/10.1109/LICS.2012.28\">https://doi.org/10.1109/LICS.2012.28</a>","ieee":"K. Chatterjee and L. Doyen, “Partial-observation stochastic games: How to win when belief fails,” in <i>Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science</i>, Dubrovnik, Croatia, 2012."},"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"5381"},{"status":"public","relation":"later_version","id":"2211"}]},"department":[{"_id":"KrCh"}],"scopus_import":"1","date_created":"2018-12-11T12:00:32Z","publication":"Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science","acknowledgement":"This work was partially supported by FWF Grant No P 23499-N23, FWF NFN Grant No S11407-N23 (RiSE), ERC Start grant (279307: Graph Games), and Microsoft faculty fellows award.","article_number":"6280436","ec_funded":1,"quality_controlled":"1","arxiv":1,"external_id":{"arxiv":["1107.2141"],"isi":["000309059900023"]},"isi":1,"fulldoi":"https://doi.org/10.1109/LICS.2012.28","publist_id":"3771","language":[{"iso":"eng"}],"day":"23","date_published":"2012-08-23T00:00:00Z","date_updated":"2026-07-07T14:01:25Z","title":"Partial-observation stochastic games: How to win when belief fails","conference":{"end_date":"2012-06-28","location":"Dubrovnik, Croatia","start_date":"2012-06-25","name":"LICS: Logic in Computer Science"},"abstract":[{"lang":"eng","text":"We consider two-player stochastic games played on finite graphs with reachability objectives where the first player tries to ensure a target state to be visited almost-surely (i.e., with probability 1), or positively (i.e., with positive probability), no matter the strategy of the second player. We classify such games according to the information and the power of randomization available to the players. On the basis of information, the game can be one-sided with either (a) player 1, or (b) player 2 having partial observation (and the other player has perfect observation), or two-sided with (c) both players having partial observation. On the basis of randomization, the players (a) may not be allowed to use randomization (pure strategies), or (b) may choose a probability distribution over actions but the actual random choice is external and not visible to the player (actions invisible), or (c) may use full randomization. Our main results for pure strategies are as follows. (1) For one-sided games with player 1 having partial observation we show that (in contrast to full randomized strategies) belief-based (subset-construction based) strategies are not sufficient, and we present an exponential upper bound on memory both for almostsure and positive winning strategies; we show that the problem of deciding the existence of almost-sure and positive winning strategies for player 1 is EXPTIME-complete. (2) For one-sided games with player 2 having partial observation we show that non-elementary memory is both necessary and sufficient for both almost-sure and positive winning strategies. (3) We show that for the general (two-sided) case finite-memory strategies are sufficient for both positive and almost-sure winning, and at least non-elementary memory is required. We establish the equivalence of the almost-sure winning problems for pure strategies and for randomized strategies with actions invisible. Our equivalence result exhibits serious flaws in previous results of the literature: we show a non-elementary memory lower bound for almost-sure winning whereas an exponential upper bound was previously claimed."}],"publisher":"IEEE","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","doi":"10.1109/LICS.2012.28","type":"conference","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","grant_number":"P 23499-N23"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"_id":"2955","status":"public"},{"abstract":[{"text":"For programs whose data variables range over Boolean or finite domains, program verification is decidable, and this forms the basis of recent tools for software model checking. In this article, we consider algorithmic verification of programs that use Boolean variables, and in addition, access a single read-only array whose length is potentially unbounded, and whose elements range over an unbounded data domain. We show that the reachability problem, while undecidable in general, is (1) PSPACE-complete for programs in which the array-accessing for-loops are not nested, (2) decidable for a restricted class of programs with doubly nested loops. The second result establishes connections to automata and logics defining languages over data words.","lang":"eng"}],"title":"Algorithmic analysis of array-accessing programs","date_updated":"2026-07-07T14:01:59Z","_id":"2967","status":"public","project":[{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989"},{"name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"}],"type":"journal_article","doi":"10.1145/2287718.2287727","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"ACM","day":"01","date_published":"2012-08-01T00:00:00Z","language":[{"iso":"eng"}],"isi":1,"fulldoi":"https://doi.org/10.1145/2287718.2287727","publist_id":"3748","external_id":{"isi":["000308370100009"]},"publication":"ACM Transactions on Computational Logic","das_tickbox":"1","date_created":"2018-12-11T12:00:36Z","department":[{"_id":"ToHe"}],"scopus_import":"1","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"4403"}]},"citation":{"apa":"Alur, R., Cerny, P., &#38; Weinstein, S. (2012). Algorithmic analysis of array-accessing programs. <i>ACM Transactions on Computational Logic</i>. ACM. <a href=\"https://doi.org/10.1145/2287718.2287727\">https://doi.org/10.1145/2287718.2287727</a>","ieee":"R. Alur, P. Cerny, and S. Weinstein, “Algorithmic analysis of array-accessing programs,” <i>ACM Transactions on Computational Logic</i>, vol. 13, no. 3. ACM, 2012.","short":"R. Alur, P. Cerny, S. Weinstein, ACM Transactions on Computational Logic 13 (2012).","chicago":"Alur, Rajeev, Pavol Cerny, and Scott Weinstein. “Algorithmic Analysis of Array-Accessing Programs.” <i>ACM Transactions on Computational Logic</i>. ACM, 2012. <a href=\"https://doi.org/10.1145/2287718.2287727\">https://doi.org/10.1145/2287718.2287727</a>.","ista":"Alur R, Cerny P, Weinstein S. 2012. Algorithmic analysis of array-accessing programs. ACM Transactions on Computational Logic. 13(3), 27.","mla":"Alur, Rajeev, et al. “Algorithmic Analysis of Array-Accessing Programs.” <i>ACM Transactions on Computational Logic</i>, vol. 13, no. 3, 27, ACM, 2012, doi:<a href=\"https://doi.org/10.1145/2287718.2287727\">10.1145/2287718.2287727</a>.","ama":"Alur R, Cerny P, Weinstein S. Algorithmic analysis of array-accessing programs. <i>ACM Transactions on Computational Logic</i>. 2012;13(3). doi:<a href=\"https://doi.org/10.1145/2287718.2287727\">10.1145/2287718.2287727</a>"},"quality_controlled":"1","ec_funded":1,"volume":13,"article_number":"27","acknowledgement":"This research was supported in part by the NSF Cybertrust award CNS 0524059, by the European Research Council (ERC) Advanced Investigator Grant QUAREM, and by the Austrian Science Fund (FWF) project S11402-N23.","author":[{"last_name":"Alur","first_name":"Rajeev","full_name":"Alur, Rajeev"},{"last_name":"Cerny","first_name":"Pavol","full_name":"Cerny, Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Weinstein","first_name":"Scott","full_name":"Weinstein, Scott"}],"publication_status":"published","issue":"3","oa_version":"None","intvolume":"        13","month":"08","year":"2012","article_processing_charge":"No"},{"author":[{"last_name":"Boker","full_name":"Boker, Udi","first_name":"Udi","id":"31E297B6-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Kupferman","full_name":"Kupferman, Orna","first_name":"Orna"}],"publication_status":"published","year":"2012","article_processing_charge":"No","oa_version":"None","issue":"4","intvolume":"        13","month":"10","citation":{"chicago":"Boker, Udi, and Orna Kupferman. “Translating to Co-Büchi Made Tight, Unified, and Useful.” <i>ACM Transactions on Computational Logic</i>. ACM, 2012. <a href=\"https://doi.org/10.1145/2362355.2362357\">https://doi.org/10.1145/2362355.2362357</a>.","short":"U. Boker, O. Kupferman, ACM Transactions on Computational Logic 13 (2012).","apa":"Boker, U., &#38; Kupferman, O. (2012). Translating to Co-Büchi made tight, unified, and useful. <i>ACM Transactions on Computational Logic</i>. ACM. <a href=\"https://doi.org/10.1145/2362355.2362357\">https://doi.org/10.1145/2362355.2362357</a>","ieee":"U. Boker and O. Kupferman, “Translating to Co-Büchi made tight, unified, and useful,” <i>ACM Transactions on Computational Logic</i>, vol. 13, no. 4. ACM, 2012.","mla":"Boker, Udi, and Orna Kupferman. “Translating to Co-Büchi Made Tight, Unified, and Useful.” <i>ACM Transactions on Computational Logic</i>, vol. 13, no. 4, 29, ACM, 2012, doi:<a href=\"https://doi.org/10.1145/2362355.2362357\">10.1145/2362355.2362357</a>.","ama":"Boker U, Kupferman O. Translating to Co-Büchi made tight, unified, and useful. <i>ACM Transactions on Computational Logic</i>. 2012;13(4). doi:<a href=\"https://doi.org/10.1145/2362355.2362357\">10.1145/2362355.2362357</a>","ista":"Boker U, Kupferman O. 2012. Translating to Co-Büchi made tight, unified, and useful. ACM Transactions on Computational Logic. 13(4), 29."},"corr_author":"1","publication":"ACM Transactions on Computational Logic","das_tickbox":"1","date_created":"2018-12-11T11:46:47Z","scopus_import":"1","department":[{"_id":"ToHe"}],"article_number":"29","quality_controlled":"1","volume":13,"language":[{"iso":"eng"}],"fulldoi":"https://doi.org/10.1145/2362355.2362357","publist_id":"7326","isi":1,"external_id":{"isi":["000310163600002"]},"day":"01","date_published":"2012-10-01T00:00:00Z","date_updated":"2026-07-07T14:02:16Z","abstract":[{"text":"We solve the longstanding open problems of the blow-up involved in the translations, when possible, of a nondeterministic Büchi word automaton (NBW) to a nondeterministic co-Büchi word automaton (NCW) and to a deterministic co-Büchi word automaton (DCW). For the NBW to NCW translation, the currently known upper bound is 2o(nlog n) and the lower bound is 1.5n. We improve the upper bound to n2n and describe a matching lower bound of 2ω(n). For the NBW to DCW translation, the currently known upper bound is 2o(nlog n). We improve it to 2 o(n), which is asymptotically tight. Both of our upper-bound constructions are based on a simple subset construction, do not involve intermediate automata with richer acceptance conditions, and can be implemented symbolically. We continue and solve the open problems of translating nondeterministic Streett, Rabin, Muller, and parity word automata to NCW and to DCW. Going via an intermediate NBW is not optimal and we describe direct, simple, and asymptotically tight constructions, involving a 2o(n) blow-up. The constructions are variants of the subset construction, providing a unified approach for translating all common classes of automata to NCW and DCW. Beyond the theoretical importance of the results, we point to numerous applications of the new constructions. In particular, they imply a simple subset-construction based translation, when possible, of LTL to deterministic Büchi word automata.","lang":"eng"}],"title":"Translating to Co-Büchi made tight, unified, and useful","doi":"10.1145/2362355.2362357","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"ACM","status":"public","_id":"494","type":"journal_article"}]