Sciweavers

785 search results - page 2 / 157
» Binary Join Trees
Sort
View
IMR
2003
Springer
14 years 3 months ago
BSP-Assisted Constrained Tetrahedralization
In this paper we tackle the problem of tetrahedralization by breaking non-convex polyhedra into convex subpolyhedra, tetrahedralizing these convex subpolyhedra and merging them to...
Bhautik Joshi, Sébastien Ourselin
DM
2008
82views more  DM 2008»
13 years 9 months ago
2-Binary trees: Bijections and related issues
A 2-binary tree is a binary rooted tree whose root is colored black and the other vertices are either black or white. We present several bijections concerning different types of 2...
Nancy S. S. Gu, Nelson Y. Li, Toufik Mansour
ICC
2008
IEEE
168views Communications» more  ICC 2008»
14 years 4 months ago
A Balanced Tree-Based Strategy for Unstructured Media Distribution in P2P Networks
—Most research on P2P multimedia streaming assumes that users access video content sequentially and passively. Unlike P2P live streaming in which the peers start playback from th...
Changqiao Xu, Gabriel-Miro Muntean, Enda Fallon, A...
FLAIRS
2009
13 years 7 months ago
Join Tree Propagation Utilizing Both Arc Reversal and Variable Elimination
In this paper, we put forth the first join tree propagation algorithm that selectively applies either arc reversal (AR) or variable elimination (VE) to build the propagated messag...
Cory J. Butz, Ken Konkel, Pawan Lingras
ICDE
2008
IEEE
163views Database» more  ICDE 2008»
14 years 11 months ago
Approximate Joins for Data-Centric XML
In data integration applications, a join matches elements that are common to two data sources. Often, however, elements are represented slightly different in each source, so an app...
Nikolaus Augsten, Michael H. Böhlen, Curtis E...