95 search results - page 4 / 19 » Lines, Trees, and Branch Spaces |
SODA
1990
ACM
13 years 8 months ago
1990
ACM
A new and conceptually simple data structure, called a suffix array, for on-line string searches is introduced in this paper. Constructing and querying suffix arrays is reduced to...
IJCNN
2007
IEEE
14 years 1 months ago
2007
IEEE
— To approximate complex data, we propose new type of low-dimensional “principal object”: principal cubic complex. This complex is a generalization of linear and nonlinear pr...
EMNLP
2009
13 years 5 months ago
2009
We present a framework to extract the most important features (tree fragments) from a Tree Kernel (TK) space according to their importance in the target kernelbased machine, e.g. ...
TOG
2012
11 years 10 months ago
2012
We present a dynamic tree modeling and representation technique that allows complex tree models to interact with their environment. Our method uses changes in the light distributi...
ASPLOS
2012
ACM
12 years 3 months ago
2012
ACM
Software developers commonly exploit multicore processors by building multithreaded software in which all threads of an application share a single address space. This shared addre...