Search

Your search keyword '"Taslakian, Perouz"' showing total 216 results
Start Over Author "Taslakian, Perouz"
216 results on '"Taslakian, Perouz"'

51. Collaboration and Technology : 21st International Conference, CRIWG 2015, Yerevan, Armenia, September 22-25, 2015, Proceedings / edited by Nelson Baloian, Yervant Zorian, Perouz Taslakian, Samvel Shoukouryan.

Author

Baloian, Nelson. editor., Zorian, Yervant. editor., Taslakian, Perouz. editor., Shoukouryan, Samvel. editor., SpringerLink (Online service), Baloian, Nelson. editor., Zorian, Yervant. editor., Taslakian, Perouz. editor., Shoukouryan, Samvel. editor., and SpringerLink (Online service)

Abstract

This book constitutes the refereed proceedings of the 21st International Conference on Collaboration and Technology, CRIWG 2015, held in Yerevan, Armenia, in September 2015. The 19 revised papers presented together with 1 invited talk were carefully reviewed and selected from 28 submissions. CRIWG has been focused on collaboration technology design, development, and evaluation. The background research is influenced by a number of disciplines, such as computer science, management science, informationsystems, engineering, psychology, cognitive sciences, and social sciences.

Published
2015

52. Cannibal Animal Games: A new variant of Tic-Tac-Toe

Author

Cardinal, Jean, Collette, Sébastien, Ito, Hiro, Korman, Matias, Langerman, Stefan, Sakaidani, Hikaru, Taslakian, Perouz, Cardinal, Jean, Collette, Sébastien, Ito, Hiro, Korman, Matias, Langerman, Stefan, Sakaidani, Hikaru, and Taslakian, Perouz

Abstract

This paper presents a new partial two-player game, called the cannibal animal game, which is a variant of Tic-Tac-Toe. The game is played on the infinite grid, where in each round a player chooses and occupies free cells. The first player Alice can occupy a cell in each turn and wins if she occupies a set of cells, the union of a subset of which is a translated, reflected and/or rotated copy of a previously agreed upon polyomino P (called an animal). The objective of the second player Bob is to prevent Alice from creating her animal by occupying in each round a translated, reflected and/or rotated copy of P. An animal is a cannibal if Bob has a winning strategy, and a non-cannibal otherwise. This paper presents some new tools, such as the bounding strategy and the punching lemma, to classify animals into cannibals or non-cannibals. We also show that the pairing strategy works for this problem., SCOPUS: ar.j, info:eu-repo/semantics/published

Published
2015

53. Non-crossing matchings of points with geometric objects

Author

Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science, Demaine, Erik D., Demaine, Martin L., Aloupis, Greg, Cardinal, Jean, Collette, Sebastien, Dulieu, Muriel, Fabila-Monroy, Ruy, Hart, Vi, Hurtado, Ferran, Langerman, Stefan, Saumell, Maria, Seara, Carlos, Taslakian, Perouz, Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science, Demaine, Erik D., Demaine, Martin L., Aloupis, Greg, Cardinal, Jean, Collette, Sebastien, Dulieu, Muriel, Fabila-Monroy, Ruy, Hart, Vi, Hurtado, Ferran, Langerman, Stefan, Saumell, Maria, Seara, Carlos, and Taslakian, Perouz

Abstract

Given an ordered set of points and an ordered set of geometric objects in the plane, we are interested in finding a non-crossing matching between point–object pairs. In this paper, we address the algorithmic problem of determining whether a non-crossing matching exists between a given point–object pair. We show that when the objects we match the points to are finite point sets, the problem is NP-complete in general, and polynomial when the objects are on a line or when their size is at most 2. When the objects are line segments, we show that the problem is NP-complete in general, and polynomial when the segments form a convex polygon or are all on a line. Finally, for objects that are straight lines, we show that the problem of finding a min-max non-crossing matching is NP-complete., Project MTM2009-07242, Gen. Cat. DGR 2009SGR1040, Association pour le developpement de la recherche sur le cancer (France), European Science Foundation (EUROCORES programme EuroGIGA), Belgian National Foundation for Scientific Research (EUROGIGA NR 13604), Belgian National Foundation for Scientific Research (MICINN Project EUI-EURC-2011-4306)

Published
2015

54. The distance geometry of music

Author

Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science, Demaine, Erik D., Toussaint, Godfried, Gomez-Martin, Francisco, Meijer, Henk, Rappaport, David, Taslakian, Perouz, Winograd, Terry, Wood, David R., Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science, Demaine, Erik D., Toussaint, Godfried, Gomez-Martin, Francisco, Meijer, Henk, Rappaport, David, Taslakian, Perouz, Winograd, Terry, and Wood, David R.

Abstract

We demonstrate relationships between the classic Euclidean algorithm and many other fields of study, particularly in the context of music and distance geometry. Specifically, we show how the structure of the Euclidean algorithm defines a family of rhythms which encompass over forty timelines (ostinatos) from traditional world music. We prove that these Euclidean rhythms have the mathematical property that their onset patterns are distributed as evenly as possible: they maximize the sum of the Euclidean distances between all pairs of onsets, viewing onsets as points on a circle. Indeed, Euclidean rhythms are the unique rhythms that maximize this notion of evenness. We also show that essentially all Euclidean rhythms are deep : each distinct distance between onsets occurs with a unique multiplicity, and these multiplicities form an interval 1,2,…,k−11,2,…,k−1. Finally, we characterize all deep rhythms, showing that they form a subclass of generated rhythms, which in turn proves a useful property called shelling. All of our results for musical rhythms apply equally well to musical scales. In addition, many of the problems we explore are interesting in their own right as distance geometry problems on the circle; some of the same problems were explored by Erdős in the plane., Natural Sciences and Engineering Research Council of Canada, Fonds québécois de la recherche sur la nature et les technologies

Published
2015

55. Convergence of the shadow sequence of inscribed polygons

Author

Gomez Martin, Francisco, Taslakian, Perouz, and Toussaint, Godfried T.

Subjects
Matemáticas
Abstract

Let P be a polygon inscribed in a circle. The shadow of P is a polygon P" whose vertices are at the midpoints of the arcs of consecutive points of P. The shadow sequence P0, P1, P2, . . . is a sequence of inscribed polygons such that each Pt is the shadow ofPt−1 for all t ! 0. We show in this abstract that the shadow sequence converges to the regular polygon, and in such way that variance decreases by at least one half at every step. Our proofs extend to the more general case where instead of placing the vertices of the shadow at the ratio of 1/2 of every arc we place them at an arbitrary fixed ratio ! (0 < ! < 1)going in the clockwise or counterclockwise direction.

Published
2008

57. Necklaces, convolutions, and X plus Y

Author

Universitat Politècnica de Catalunya. DCCG - Grup de recerca en geometria computacional, combinatoria i discreta, Bremner, David, Chan, Timothy M., Demaine, Erik D., Erickson, Jeff, Hurtado Díaz, Fernando Alfredo, Iacono, John, Langerman, Stefan, Patrascu, Mihai, Taslakian, Perouz, Universitat Politècnica de Catalunya. DCCG - Grup de recerca en geometria computacional, combinatoria i discreta, Bremner, David, Chan, Timothy M., Demaine, Erik D., Erickson, Jeff, Hurtado Díaz, Fernando Alfredo, Iacono, John, Langerman, Stefan, Patrascu, Mihai, and Taslakian, Perouz

Abstract

We give subquadratic algorithms that, given two necklaces each with n beads at arbitrary positions, compute the optimal rotation of the necklaces to best align the beads. Here alignment is measured according to the ℓ p norm of the vector of distances between pairs of beads from opposite necklaces in the best perfect matching. We show surprisingly different results for p=1, p=2, and p=∞. For p=2, we reduce the problem to standard convolution, while for p=∞ and p=1, we reduce the problem to (min,+) convolution and (median,+) convolution. Then we solve the latter two convolution problems in subquadratic time, which are interesting results in their own right. These results shed some light on the classic sorting X + Y problem, because the convolutions can be viewed as computing order statistics on the antidiagonals of the X + Y matrix. All of our algorithms run in o(n 2) time, whereas the obvious algorithms for these problems run in Θ(n 2) time, Peer Reviewed, Postprint (published version)

Published
2014

58. Theta-3 is connected

Author

Aichholzer, Oswin, primary, Bae, Sang Won, additional, Barba, Luis, additional, Bose, Prosenjit, additional, Korman, Matias, additional, van Renssen, André, additional, Taslakian, Perouz, additional, and Verdonschot, Sander, additional

Published
2014
Full Text
View/download PDF

59. New and Improved Spanning Ratios for Yao Graphs

Author

Barba, Luis, primary, Bose, Prosenjit, additional, Damian, Mirela, additional, Fagerberg, Rolf, additional, Keng, Wah Loon, additional, O'Rourke, Joseph, additional, van Renssen, André, additional, Taslakian, Perouz, additional, Verdonschot, Sander, additional, and Xia, Ge, additional

Published
2014
Full Text
View/download PDF

60. Coloring and guarding arrangements

Author

Bose, Prosenjit, Cardinal, Jean, Collette, Sébastien, Hurtado, Ferran, Korman, Matias, Langerman, Stefan, Taslakian, Perouz, Bose, Prosenjit, Cardinal, Jean, Collette, Sébastien, Hurtado, Ferran, Korman, Matias, Langerman, Stefan, and Taslakian, Perouz

Abstract

Given a simple arrangement of lines in the plane, what is the minimum number c of colors required so that we can color all lines in a way that no cell of the arrangement is monochromatic? In this paper we give worst-case bounds on the number c for both the above question and for some of its variations. Line coloring problems can be redefined as geometric hypergraph coloring problems as follows: if we define Hline-cell as the hypergraph whose vertices are lines and edges are cells of the arrangement, then c is equal to the chromatic number of this hypergraph. Specifically, we prove that this chromatic number is between Ω(log n= log log n) and O( √n). Furthermore, we give bounds on the minimum size of a subset S of the intersection points between pairs of lines in A such that every cell contains at least a vertex of S. This may be seen as the problem of guarding cells with vertices when the lines act as obstacles. The problem can also be defined as the minimum vertex cover problem in the hypergraph Hvertex-cell, the vertices of which are the line intersections, and the hyperedges are vertices of a cell. Analogously, we consider the problem of touching the lines with a minimum subset of the cells of the arrangement, which we identify as the minimum vertex cover problem in the Hcell-zone hypergraph. © 2013 Discrete Mathematics and Theoretical Computer Science (DMTCS), Nancy, France., SCOPUS: ar.j, info:eu-repo/semantics/published

Published
2013

61. Transversals in trees

Author

Campos, Victor, Chvatal, Vasek, Devroye, Luc, Taslakian, Perouz, Campos, Victor, Chvatal, Vasek, Devroye, Luc, and Taslakian, Perouz

Abstract

A transversal in a rooted tree is any set of nodes that meets every path from the root to a leaf. We let c(T,k) denote the number oftransversals of size k in a rooted tree T.We define a partial order on the set of all rooted trees with n nodes by saying that a tree T succeeds a tree T. if c(T,k) is at least c(T,k) for all k and strictly greater than c(T,k) for at leastone k. We prove that, for every choice of positive integers d and n, the set of all rooted trees on n nodes where each node has atmost d children has aunique minimal element with respect to this partial order and we describethis tree. In addition, we determine asymptotically the expected values of c(T,k) in special families of trees. © 2012 Wiley Periodicals, Inc., SCOPUS: ar.j, FLWIN, info:eu-repo/semantics/published

Published
2013

62. Matching Points with Things

Author

Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science, Demaine, Erik D., Demaine, Martin L., Aloupis, Greg, Cardinal, Jean, Collette, Sebastien, Dulieu, Muriel, Fabila-Monroy, Ruy, Hart, Vi, Hurtado, Ferran, Langerman, Stefan, Saumell, Maria, Seara, Carlos, Taslakian, Perouz, Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science, Demaine, Erik D., Demaine, Martin L., Aloupis, Greg, Cardinal, Jean, Collette, Sebastien, Dulieu, Muriel, Fabila-Monroy, Ruy, Hart, Vi, Hurtado, Ferran, Langerman, Stefan, Saumell, Maria, Seara, Carlos, and Taslakian, Perouz

Abstract

Given an ordered set of points and an ordered set of geometric objects in the plane, we are interested in finding a non-crossing matching between point-object pairs. We show that when the objects we match the points to are finite point sets, the problem is NP-complete in general, and polynomial when the objects are on a line or when their number is at most 2. When the objects are line segments, we show that the problem is NP-complete in general, and polynomial when the segments form a convex polygon or are all on a line. Finally, for objects that are straight lines, we show that the problem of finding a min-max non-crossing matching is NP-complete.

Published
2012

63. Cannibal Animal Games: A new variant of Tic-Tac-Toe

Author

Cardinal, Jean, Collette, Sébastien, Ito, Hiro, Korman, Matias, Langerman, Stefan, Sakaidani, Hikaru, Taslakian, Perouz, Cardinal, Jean, Collette, Sébastien, Ito, Hiro, Korman, Matias, Langerman, Stefan, Sakaidani, Hikaru, and Taslakian, Perouz

Abstract

info:eu-repo/semantics/published

Published
2011

64. Deflating polygons to the limit

Author

Hubard Escalera, Isabel, Taslakian, Perouz, Hubard Escalera, Isabel, and Taslakian, Perouz

Abstract

info:eu-repo/semantics/published

Published
2010

65. Matching points with things

Author

Taslakian, Perouz, Aloupis, Greg, Cardinal, Jean, Collette, Sébastien, Demaine, Erik D., Demaine, Martin L., Dulieu, Muriel, Fabila-Monroy, Ruy, Hart, Vi, Hurtado, Ferran, Langerman, Stefan, Saumell Mendiola, Maria, Seara, Carlos, Taslakian, Perouz, Aloupis, Greg, Cardinal, Jean, Collette, Sébastien, Demaine, Erik D., Demaine, Martin L., Dulieu, Muriel, Fabila-Monroy, Ruy, Hart, Vi, Hurtado, Ferran, Langerman, Stefan, Saumell Mendiola, Maria, and Seara, Carlos

Abstract

Given an ordered set of points and an ordered set of geometric objects in the plane, we are interested in finding a non-crossing matching between point-object pairs. We show that when the objects we match the points to are finite point sets, the problem is NP-complete in general, and polynomial when the objects are on a line or when their number is at most 2. When the objects are line segments, we show that the problem is NP-complete in general, and polynomial when the segments form a convex polygon or are all on a line. Finally, for objects that are straight lines, we show that the problem of finding a min-max non-crossing matching is NP-complete. © 2010 Springer-Verlag., Proceedings of the 9th Latin American Theoretical Informatics (LATIN 2010), SCOPUS: cp.k, info:eu-repo/semantics/published

Published
2010

66. Matching points with things

Author

Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada II, Universitat Politècnica de Catalunya. DCCG - Grup de recerca en geometria computacional, combinatoria i discreta, Taslakian, Perouz, Seara Ojea, Carlos, Saumell Mendiola, Maria, Langerman, Stefan, Hurtado Díaz, Fernando Alfredo, Aloupis, Greg, Cardinal, Jean, Collette, Sébastien, Demaine, Erik D., Demaine, Martin L., Dulieu, Muriel, Fabila Monroy, Ruy, Hart, Vi, Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada II, Universitat Politècnica de Catalunya. DCCG - Grup de recerca en geometria computacional, combinatoria i discreta, Taslakian, Perouz, Seara Ojea, Carlos, Saumell Mendiola, Maria, Langerman, Stefan, Hurtado Díaz, Fernando Alfredo, Aloupis, Greg, Cardinal, Jean, Collette, Sébastien, Demaine, Erik D., Demaine, Martin L., Dulieu, Muriel, Fabila Monroy, Ruy, and Hart, Vi

Abstract

Given an ordered set of points and an ordered set of geometric objects in the plane, we are interested in finding a non-crossing matching between point-object pairs. We show that when the objects we match the points to are finite point sets, the problem is NP-complete in general, and polynomial when the objects are on a line or when their number is at most 2. When the objects are line segments, we show that the problem is NP-complete in general, and polynomial when the segments form a convex polygon or are all on a line. Finally, for objects that are straight lines, we show that the problem of finding a min-max non-crossing matching is NP-complete., Postprint (published version)

Published
2010

67. Colorful strips

Author

Aloupis, Greg, Cardinal, Jean, Collette, Sébastien, Imahori, Shinji S., Korman, Matias, Langerman, Stefan, Schwartz, Oded, Smorodinsky, Shakhar S., Taslakian, Perouz, Aloupis, Greg, Cardinal, Jean, Collette, Sébastien, Imahori, Shinji S., Korman, Matias, Langerman, Stefan, Schwartz, Oded, Smorodinsky, Shakhar S., and Taslakian, Perouz

Abstract

arXiv:0904.2115, info:eu-repo/semantics/published

Published
2009

68. Matching points with things

Author

Aloupis, Greg, Cardinal, Jean, Collette, Sébastien, Demaine, Erik D., Demaine, Martin L., Dulieu, Muriel, Fabila-Monroy, Ruy, Hart, Vi, Hurtado, Ferran, Langerman, Stefan, Saumell Mendiola, Maria, Seara, Carlos, Taslakian, Perouz, Aloupis, Greg, Cardinal, Jean, Collette, Sébastien, Demaine, Erik D., Demaine, Martin L., Dulieu, Muriel, Fabila-Monroy, Ruy, Hart, Vi, Hurtado, Ferran, Langerman, Stefan, Saumell Mendiola, Maria, Seara, Carlos, and Taslakian, Perouz

Abstract

JCCGG09, info:eu-repo/semantics/published

Published
2009

69. Relaxed gabriel graphs

Author

Bose, Prosenjit, Cardinal, Jean, Collette, Sébastien, Demaine, Erik D., Palop, Belén B., Taslakian, Perouz, Zeh, Norbert, Bose, Prosenjit, Cardinal, Jean, Collette, Sébastien, Demaine, Erik D., Palop, Belén B., Taslakian, Perouz, and Zeh, Norbert

Abstract

info:eu-repo/semantics/published

Published
2009

70. Structural properties of Euclidean rhythms

Author

Gomez-Martin, Francisco, Taslakian, Perouz, Toussaint, Godfried G., Gomez-Martin, Francisco, Taslakian, Perouz, and Toussaint, Godfried G.

Abstract

info:eu-repo/semantics/published

Published
2009

71. Reconstructing points on a circle from labeled distances

Author

Bremner, David, Demaine, Erik D., Taslakian, Perouz, Toussaint, Godfried G., Bremner, David, Demaine, Erik D., Taslakian, Perouz, and Toussaint, Godfried G.

Abstract

info:eu-repo/semantics/published

Published
2009

72. Interlocking and Euclidean rhythms

Author

Gomez-Martin, Francisco, Taslakian, Perouz, Toussaint, Godfried G., Gomez-Martin, Francisco, Taslakian, Perouz, and Toussaint, Godfried G.

Abstract

1, info:eu-repo/semantics/published

Published
2009

73. A pumping lemma for homometric rhythms

Author

O'Rourke, Joseph, Taslakian, Perouz, Toussaint, Godfried G., O'Rourke, Joseph, Taslakian, Perouz, and Toussaint, Godfried G.

Abstract

info:eu-repo/semantics/published

Published
2008

74. Evenness preserving operations on musical rhythms

Author

Gomez-Martin, Francisco, Taslakian, Perouz, Toussaint, Godfried G., Gomez-Martin, Francisco, Taslakian, Perouz, and Toussaint, Godfried G.

Abstract

info:eu-repo/semantics/published

Published
2008

76. Coloring and Guarding Arrangements

Author

Bose, Prosenjit, primary, Cardinal, Jean, additional, Collette, Sébastien, additional, Hurtado, Ferran, additional, Korman, Matias, additional, Langerman, Stefan, additional, and Taslakian, Perouz, additional

Published
2013
Full Text
View/download PDF

77. Vertex pops and popturns

Author

Aloupis, Greg, Ballinger, Brad, Bose, Prosenjit, Damien, Mirela, Demaine, Erik D., Demaine, Martin L., Flatland, Robin R., Hurtado, Ferran, Langerman, Stefan, O'Rourke, Joseph, Taslakian, Perouz, Toussaint, Godfried G., Aloupis, Greg, Ballinger, Brad, Bose, Prosenjit, Damien, Mirela, Demaine, Erik D., Demaine, Martin L., Flatland, Robin R., Hurtado, Ferran, Langerman, Stefan, O'Rourke, Joseph, Taslakian, Perouz, and Toussaint, Godfried G.

Abstract

info:eu-repo/semantics/published

Published
2007

78. Sand drawings and Gaussian graphs

Author

Demaine, Erik D., Demaine, Martin L., Taslakian, Perouz, Toussaint, Godfried G., Demaine, Erik D., Demaine, Martin L., Taslakian, Perouz, and Toussaint, Godfried G.

Abstract

info:eu-repo/semantics/published

Published
2007

79. Deflating the Pentagon

Author

Demaine, Erik D., Demaine, Martin L., Fevens, Thomas T., Mesa, Antonio A., Soss, Michael M., Souvaine, Diane D., Taslakian, Perouz, Toussaint, Godfried G., Demaine, Erik D., Demaine, Martin L., Fevens, Thomas T., Mesa, Antonio A., Soss, Michael M., Souvaine, Diane D., Taslakian, Perouz, and Toussaint, Godfried G.

Abstract

info:eu-repo/semantics/published

Published
2007

80. On rolling cube puzzles

Author

Buchin, Kevin, Buchin, Maike, Demaine, Erik D., Demaine, Martin L., El-Khechen, Dania, Fekete, Sandor, Knauer, Christian C., Schulz, Anneli, Taslakian, Perouz, Buchin, Kevin, Buchin, Maike, Demaine, Erik D., Demaine, Martin L., El-Khechen, Dania, Fekete, Sandor, Knauer, Christian C., Schulz, Anneli, and Taslakian, Perouz

Abstract

info:eu-repo/semantics/published

Published
2007

81. Sand drawings and Gaussian graphs

Author

Demaine, Erik D., Demaine, Martin L., Taslakian, Perouz, Toussaint, Godfried G., Demaine, Erik D., Demaine, Martin L., Taslakian, Perouz, and Toussaint, Godfried G.

Abstract

info:eu-repo/semantics/published

Published
2006

82. Curves in the sand: Algorithmic drawing

Author

Damien, Mirela, Demaine, Erik D., Demaine, Martin L., Dujmović, Vida V., El-Khechen, Dania, Flatland, Robin R., Iacono, John, Langerman, Stefan, Meijer, Henk H., Ramaswami, Suneeta S., Souvaine, Diane D., Taslakian, Perouz, Toussaint, Godfried G., Damien, Mirela, Demaine, Erik D., Demaine, Martin L., Dujmović, Vida V., El-Khechen, Dania, Flatland, Robin R., Iacono, John, Langerman, Stefan, Meijer, Henk H., Ramaswami, Suneeta S., Souvaine, Diane D., Taslakian, Perouz, and Toussaint, Godfried G.

Abstract

info:eu-repo/semantics/published

Published
2006

83. Geometric properties of musical rhythms

Author

16th Fall Workshop on Computational Geometry (FWCG 2006) (November 2006), Taslakian, Perouz, Toussaint, Godfried G., 16th Fall Workshop on Computational Geometry (FWCG 2006) (November 2006), Taslakian, Perouz, and Toussaint, Godfried G.

Abstract

info:eu-repo/semantics/nonPublished

Published
2006

84. The distance geometry of Deep rhythms and scales

Author

Demaine, Erik D., Gomez-Martin, Francisco, Meijer, Henk H., Rappaport, David D., Taslakian, Perouz, Toussaint, Godfried G., Winograd, Terry, Wood, David, Demaine, Erik D., Gomez-Martin, Francisco, Meijer, Henk H., Rappaport, David D., Taslakian, Perouz, Toussaint, Godfried G., Winograd, Terry, and Wood, David

Abstract

info:eu-repo/semantics/published

Published
2005

85. Necklaces, Convolutions, and X+Y

Author

Bremner, David, primary, Chan, Timothy M., additional, Demaine, Erik D., additional, Erickson, Jeff, additional, Hurtado, Ferran, additional, Iacono, John, additional, Langerman, Stefan, additional, Pǎtraşcu, Mihai, additional, and Taslakian, Perouz, additional

Published
2012
Full Text
View/download PDF

86. Transversals in Trees

Author

Campos, Victor, primary, Chvátal, Vašek, additional, Devroye, Luc, additional, and Taslakian, Perouz, additional

Published
2012
Full Text
View/download PDF

87. Orderly broadcasting in a 2d torus

Author

Harutyunyan, Hovhannes A., Taslakian, Perouz, Harutyunyan, Hovhannes A., and Taslakian, Perouz

Abstract

info:eu-repo/semantics/published

Published
2004

92. Necklaces, Convolutions, and X + Y.

Author

Azar, Yossi, Erlebach, Thomas, Bremner, David, Chan, Timothy M., Demaine, Erik D., Erickson, Jeff, Hurtado, Ferran, Iacono, John, Langerman, Stefan, and Taslakian, Perouz

Abstract

We give subquadratic algorithms that, given two necklaces each with n beads at arbitrary positions, compute the optimal rotation of the necklaces to best align the beads. Here alignment is measured according to the ℓp norm of the vector of distances between pairs of beads from opposite necklaces in the best perfect matching. We show surprisingly different results for p=1, p=2, and p=∞. For p=2, we reduce the problem to standard convolution, while for p=∞ and p=1, we reduce the problem to (min,+) convolution and (median,+) convolution. Then we solve the latter two convolution problems in subquadratic time, which are interesting results in their own right. These results shed some light on the classic sorting X + Y problem, because the convolutions can be viewed as computing order statistics on the antidiagonals of the X + Y matrix. All of our algorithms run in o(n2) time, whereas the obvious algorithms for these problems run in Θ(n2) time. [ABSTRACT FROM AUTHOR]

Published
2006
Full Text
View/download PDF

93. Exploiting the Use of Wikis to Support Collaborative Writing: A Case Study of an Undergraduate Computer Science Class

Author

Adewoyin, Oluwabunmi, Wu, Kewen, Vassileva, Julita, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Baloian, Nelson, editor, Zorian, Yervant, editor, Taslakian, Perouz, editor, and Shoukouryan, Samvel, editor

Published
2015
Full Text
View/download PDF

94. Supporting Collaborative Decision Making in Geo-Collaboration Scenarios

Author

Baloian, Nelson, Frez, Jonathan, Pino, José A., Zurita, Gustavo, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Baloian, Nelson, editor, Zorian, Yervant, editor, Taslakian, Perouz, editor, and Shoukouryan, Samvel, editor

Published
2015
Full Text
View/download PDF

95. A Behaviour Awareness Mechanism to Support Collaborative Learning

Author

Medina, Esunly, Meseguer, Roc, Ochoa, Sergio F., Medina, Humberto, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Baloian, Nelson, editor, Zorian, Yervant, editor, Taslakian, Perouz, editor, and Shoukouryan, Samvel, editor

Published
2015
Full Text
View/download PDF

96. An Integrative Tool Chain for Collaborative Virtual Museums in Immersive Virtual Environments

Author

Sacher, Daniel, Weyers, Benjamin, Kuhlen, Torsten W., Luther, Wolfram, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Baloian, Nelson, editor, Zorian, Yervant, editor, Taslakian, Perouz, editor, and Shoukouryan, Samvel, editor

Published
2015
Full Text
View/download PDF

97. Using Real-Time Gaze Based Awareness Methods to Enhance Collaboration

Author

Schlösser, Christian, Schlieker-Steens, Philipp, Kienle, Andrea, Harrer, Andreas, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Baloian, Nelson, editor, Zorian, Yervant, editor, Taslakian, Perouz, editor, and Shoukouryan, Samvel, editor

Published
2015
Full Text
View/download PDF

98. Analysis of Question and Answering Behavior in Question Routing Services

Author

Liu, Zhe, Jansen, Bernard J., Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Baloian, Nelson, editor, Zorian, Yervant, editor, Taslakian, Perouz, editor, and Shoukouryan, Samvel, editor

Published
2015
Full Text
View/download PDF

99. Measuring the Effort Demanded by CSCL Design Processes Supporting a Consistent Artifact Flow

Author

Bordiés, Osmel, Dimitriadis, Yannis, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Baloian, Nelson, editor, Zorian, Yervant, editor, Taslakian, Perouz, editor, and Shoukouryan, Samvel, editor

Published
2015
Full Text
View/download PDF

100. Contrasting People’s Attitudes Towards Self-disclosure in Online Social Networks and Face-to-Face Settings

Author

Villela, Maria L. B., Xavier, Simone I. R., Prates, Raquel O., Prates, Marcos O., Shipman, Frank, Prates, Antônio A. P., Cardoso, Alexandre A., Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Baloian, Nelson, editor, Zorian, Yervant, editor, Taslakian, Perouz, editor, and Shoukouryan, Samvel, editor

Published
2015
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results