16430 search results - page 28 / 3286 » On Computable Tree Functions |
HIPC
2005
Springer
14 years 1 months ago
2005
Springer
Several challenging new applications demand the ability to do data mining on resource constrained devices. One such application is that of monitoring physiological data streams ob...
ACSC
2001
IEEE
13 years 11 months ago
2001
IEEE
This paper analyses the efficiency of different data structures for detecting overlap in digital documents. Most existing approaches use some hash function to reduce the space req...
DLT
2006
13 years 9 months ago
2006
Abstract. Tree series transformations computed by polynomial topdown and bottom-up tree series transducers are considered. The hierarchy of tree series transformations obtained in ...
CIDM
2007
IEEE
13 years 11 months ago
2007
IEEE
Kernel methods are effective approaches to the modeling of structured objects in learning algorithms. Their major drawback is the typically high computational complexity of kernel ...
RSA
2010
13 years 6 months ago
2010
The weight of a randomly chosen link in the shortest path tree on the complete graph with exponential i.i.d. link weights is studied. The corresponding exact probability generatin...