D
Dina Goldin
Researcher at University of Connecticut
Publications - 48
Citations - 1979
Dina Goldin is an academic researcher from University of Connecticut. The author has contributed to research in topics: Interactive computation & Turing machine. The author has an hindex of 24, co-authored 48 publications receiving 1931 citations. Previous affiliations of Dina Goldin include University of Massachusetts Boston & University of Massachusetts Amherst.
Papers
More filters
Book ChapterDOI
On Similarity Queries for Time-Series Data: Constraint Specification and Implementation
Dina Goldin,Paris C. Kanellakis +1 more
TL;DR: The intuitive notions of exact and approximate similarity between time-series patterns and data are formalized and the definition of similarity extends the distance metric used in [2, 7] with invariance under a group of transformations.
Book
Interactive Computation: The New Paradigm
TL;DR: The interaction paradigm is a new conceptualization of computational phenomena that emphasizes interaction over algorithms, reflecting the shift in technology from main-frame number-crunching to distributed intelligent networks with graphical user interfaces.
Journal ArticleDOI
Computation beyond turing machines
Peter Wegner,Dina Goldin +1 more
TL;DR: Researchers are seeking appropriate methods to model computing and human thought to help improve the quality of knowledge in the rapidly changing environment.
Journal ArticleDOI
Turing machines, transition systems, and interaction
TL;DR: A number of results are presented, including a proof that the class of PTMs is isomorphic to a general class of effective transition systems called interactive transition systems; and aProof that PTMs without persistence (amnesic PTMs) are less expressive than PTMs.
Book ChapterDOI
Constraint Programming and Database Query Languages
Paris C. Kanellakis,Dina Goldin +1 more
TL;DR: This overview of constraint query languages (CQLs) presents an algebra for dense order constraints that is simpler to evaluate than the calculus described in [KKR], and sharpen some of the related data complexity bounds.