Dina Q. Goldin

Publications69
h-index23
Citations2,012
Highly Influential Citations77
Claim Author Page
Author pages are created from data sourced from our academic publisher partnerships and public sources.

Recommended Authors

  • P. Wegner
  • 211 Publications • 8,809 Citations
  • P. Kanellakis
  • 112 Publications • 7,231 Citations
  • S. Grumbach
  • 114 Publications • 3,302 Citations
  • J. Ullman
  • 432 Publications • 86,102 Citations
  • Publications
  • Influence
On Similarity Queries for Time-Series Data: Constraint Specification and Implementation
TLDR
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.
Computation beyond turing machines
TLDR
Researchers are seeking appropriate methods to model computing and human thought to help improve the quality of knowledge in the rapidly changing environment.
Persistent Turing Machines as a Model of Interactive Computation
TLDR
The methods and tools for formalizing PTM computation developed in this paper can serve as a basis for a more comprehensive theory of interactive computation.
Interaction as a Framework for Modeling
TLDR
This paper reviews single-stream and multiple-stream interaction machines, extensions of set theory and algebra for models of sequential interaction, and interactive extensions of the Turing test to motivate the use of interactive models as a basis for applications to computer architecture, software engineering, and artificial intelligence.
Constraint Programming and Database Query Languages
TLDR
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.
Turing machines, transition systems, and interaction
The Church-Turing Thesis: Breaking the Myth
TLDR
This paper identifies and analyzes the historical reasons for widespread belief that no model of computation more expressive than Turing machines can exist, and presents one such model, Persistent Turing Machines (PTMs), which capture sequential interaction, which is a limited form of concurrency.
Coinductive Models of Finite Computing Agents
Georouting and Delta-Gathering: Efficient Data Propagation Techniques for GeoSensor Networks
TLDR
This work considers the issue of query and data propagation i the context of geosensor networks over geo-aware sensors, and presents sensor terrains as a preferable alternative to isoline-based visualization ( contour maps ) for this problem.
Mathematical Models of Interactive Computing
TLDR
The goal is to provide multiple perspective on interactive modeling from the viewpoint of interaction machines and mathematics, to persuade readers that interaction paradigms can play a significant role in narrowing the gap between theoretical models and software practice.
...
1
2
3
4
5
...