Sciweavers

2553 search results - page 43 / 511
» Modeling Trees with Hypertextures
Sort
View
PKDD
2010
Springer
178views Data Mining» more  PKDD 2010»
14 years 8 months ago
Large-Scale Support Vector Learning with Structural Kernels
Abstract. In this paper, we present an extensive study of the cuttingplane algorithm (CPA) applied to structural kernels for advanced text classification on large datasets. In par...
Aliaksei Severyn, Alessandro Moschitti
EJWCN
2010
115views more  EJWCN 2010»
14 years 4 months ago
Efficient Certification Path Discovery for MANET
A Mobile Ad Hoc Network (MANET) is characterized by the lack of any infrastructure, absence of any kind of centralized administration, frequent mobility of nodes, network partitio...
Georgios Kambourakis, Elisavet Konstantinou, Anast...
SODA
2010
ACM
200views Algorithms» more  SODA 2010»
15 years 7 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
2010
168views more  CGF 2010»
14 years 9 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
AI
2008
Springer
14 years 10 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