Sciweavers

502 search results - page 46 / 101
» Verifying Balanced Trees
Sort
View
HPDC
2007
IEEE
14 years 1 months ago
MOB: zero-configuration high-throughput multicasting for grid applications
Grid applications often need to distribute large amounts of data efficiently from one cluster to multiple others (multicast). Existing methods usually arrange nodes in optimized t...
Mathijs den Burger, Thilo Kielmann
POPL
2005
ACM
14 years 10 months ago
Context logic and tree update
Spatial logics have been used to describe properties of treelike structures (Ambient Logic) and in a Hoare style to reason about dynamic updates of heap-like structures (Separatio...
Cristiano Calcagno, Philippa Gardner, Uri Zarfaty
KDD
2006
ACM
113views Data Mining» more  KDD 2006»
14 years 10 months ago
A new efficient probabilistic model for mining labeled ordered trees
Mining frequent patterns is a general and important issue in data mining. Complex and unstructured (or semi-structured) datasets have appeared in major data mining applications, i...
Kosuke Hashimoto, Kiyoko F. Aoki-Kinoshita, Nobuhi...
DAGM
2005
Springer
14 years 3 months ago
A Method for Fast Search of Variable Regions on Dynamic 3D Point Clouds
The paper addresses the region search problem in three-dimensional (3D) space. The data used is a dynamically growing point cloud as it is typically gathered with a 3D-sensing devi...
Eric Wahl, Gerd Hirzinger
COORDINATION
2004
Springer
14 years 3 months ago
A Component-Based Parallel Constraint Solver
As a case study that illustrates our view on coordination and component-based software engineering, we present the design and implementation of a parallel constraint solver. The pa...
Peter Zoeteweij, Farhad Arbab