252 search results - page 30 / 51 » Automata for Data Words and Data Trees |
EURODAC
1995
IEEE
13 years 11 months ago
1995
IEEE
This paper describes a method to optimize the performance of data paths. It is based on bit-level arithmetic transformations, and is especially suited to optimize large adder stru...
PAKDD
2009
ACM
14 years 2 months ago
2009
ACM
One important problem proposed recently in the field of web mining is website classification problem. The complexity together with the necessity to have accurate and fast algorit...
JACM
2007
13 years 7 months ago
2007
We introduce exponential search trees as a novel technique for converting static polynomial space search structures for ordered sets into fully-dynamic linear space data structure...
ICFP
2006
ACM
14 years 7 months ago
2006
ACM
Often, independent organizations define and advocate different XML formats for a similar purpose and, as a result, application programs need to mutually convert between such forma...
CORR
2012
Springer
12 years 3 months ago
2012
Springer
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the classical model where the d...