Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Octavian Procopiuc"'
Autor:
Anna O. Bilska, Jason R. Salemme, Magdalena Procopiuc, Susan H. Rodger, Octavian Procopiuc, Edwin Tsang, Kenneth H. Leider
Publikováno v:
SIGCSE
We present a collection of new and enhanced tools for experimenting with concepts in formal languages and automata theory. New tools, written in Java, include JFLAP for creating and simulating finite automata, pushdown automata and Turing machines; P
Publikováno v:
Advances in Spatial and Temporal Databases ISBN: 9783540281276
SSTD
SSTD
In this paper we study the problem of estimating several types of spatial queries in a streaming environment. We propose a new approach, which we call Local Kernels, for computing density estimators by using local rather than global statistics on the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::eeb14841ebb0db6f8ce75695ade80303
https://doi.org/10.1007/11535331_7
https://doi.org/10.1007/11535331_7
Publikováno v:
Advances in Spatial and Temporal Databases ISBN: 9783540405351
SSTD
SSTD
In this paper we propose a new index structure, called the Bkd-tree, for indexing large multi-dimensional point data sets. The Bkd-tree is an I/O-efficient dynamic data structure based on the kd-tree. We present the results of an extensive experiment
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::adcd8a077743892876a3d5589561599e
https://doi.org/10.1007/978-3-540-45072-6_4
https://doi.org/10.1007/978-3-540-45072-6_4
Publikováno v:
Technology-Based Re-Engineering Engineering Education Proceedings of Frontiers in Education FIE'96 26th Annual Conference.
The computer science formal languages course becomes a more traditional computer science course by integrating visual and interactive tools into the course, allowing students to gain hands-on experience with theoretical concepts. We explain how the t
Publikováno v:
Algorithms — ESA 2002 ISBN: 9783540441809
ESA
ESA
In recent years, many theoretically I/O-efficient algorithms and data structures have been developed. The TPIE project at Duke University was started to investigate the practical importance of these theoretical results. The goal of this ongoing proje
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5c53cdf51f882badce5f037811f4bbdf
https://doi.org/10.1007/3-540-45749-6_12
https://doi.org/10.1007/3-540-45749-6_12
Publikováno v:
Automata, Languages and Programming ISBN: 9783540422877
ICALP
ICALP
In this paper we investigate automated methods for externalizing internal memory data structures.We consider a class of balanced trees that we call weight-balanced partitioning trees (or wp-trees) for indexing a set of points in Rd.Well-known example
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::85d0bb9a7b2a33003f5744ea9f357ac6
https://doi.org/10.1007/3-540-48224-5_10
https://doi.org/10.1007/3-540-48224-5_10
Publikováno v:
Theoretical Computer Science. (2):365-385
In this paper we investigate several decision problems for parallel communicating grammar systems: the enabling, circularity, centralizing, conflict-freeness, boundedness, membership, equivalence, inclusion, emptiness and finiteness problems. The fir
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.