Sciweavers

14403 search results - page 50 / 2881
» Dynamical Systems Trees
Sort
View
CAV
2009
Springer
134views Hardware» more  CAV 2009»
14 years 10 months ago
Predecessor Sets of Dynamic Pushdown Networks with Tree-Regular Constraints
Abstract. Dynamic Pushdown Networks (DPNs) are a model for parallel programs with (recursive) procedures and process creation. The goal of this paper is to develop generic techniqu...
Alexander Wenner, Markus Müller-Olm, Peter La...
ICPR
2000
IEEE
14 years 11 months ago
MFDTs: Mean Field Dynamic Trees
Tree structured belief networks are attractive for image segmentation tasks. However, networks with fixed architectures are not very suitable as they lead to blocky arte
Nicholas J. Adams, Amos J. Storkey, Christopher K....
SODA
2001
ACM
144views Algorithms» more  SODA 2001»
13 years 11 months ago
Representing dynamic binary trees succinctly
We introduce a new updatable representation ofbinary trees. The structure requires the information theoretic minimum 2n + o(n) bits and supports basic navigational operations in c...
J. Ian Munro, Venkatesh Raman, Adam J. Storm
SSD
2005
Springer
185views Database» more  SSD 2005»
14 years 3 months ago
Evaluation of a Dynamic Tree Structure for Indexing Query Regions on Streaming Geospatial Data
Most recent research on querying and managing data streams has concentrated on traditional data models where the data come in the form of tuples or XML data. Complex types of strea...
Quinn Hart, Michael Gertz, Jie Zhang
JACM
2007
132views more  JACM 2007»
13 years 9 months ago
Dynamic ordered sets with exponential search trees
We introduce exponential search trees as a novel technique for converting static polynomial space search structures for ordered sets into fully-dynamic linear space data structure...
Arne Andersson, Mikkel Thorup