Sciweavers

5699 search results - page 64 / 1140
» Alternating model trees
Sort
View
SODA
2010
ACM
200views Algorithms» more  SODA 2010»
16 years 1 months ago
Fully-Functional Succinct Trees
We propose new succinct representations of ordinal trees, which have been studied extensively. It is known that any n-node static tree can be represented in 2n + o(n) bits and a l...
Kunihiko Sadakane, Gonzalo Navarro
CGF
2004
111views more  CGF 2004»
15 years 4 months ago
Modeling Trees with Hypertextures
In the paper, a new method for modelling trees at medium detail is presented. The method is based on a volumetric representation of trees, generated by an iterated function system...
Damjan Strnad, Nikola Guid
ICDCS
2009
IEEE
16 years 1 months ago
A Commutative Replicated Data Type for Cooperative Editing
A Commutative Replicated Data Type (CRDT) is one where all concurrent operations commute. The replicas of a CRDT converge automatically, without complex concurrency control. This ...
Nuno M. Preguiça, Joan Manuel Marquè...
CGF
2010
168views more  CGF 2010»
15 years 4 months ago
Modeling Complex Unfoliaged Trees from a Sparse Set of Images
We present a novel image-based technique for modeling complex unfoliaged trees. Existing tree modeling tools either require capturing a large number of views for dense 3D reconstr...
Luis D. Lopez, Yuanyuan Ding, Jingyi Yu
114
Voted
AI
2008
Springer
15 years 4 months ago
Properties of tree convex constraints
It is known that a tree convex network is globally consistent if it is path consistent. However, if a tree convex network is not path consistent, enforcing path consistency on it ...
Yuanlin Zhang, Eugene C. Freuder