5699 search results - page 910 / 1140 » Alternating model trees |
299
click to vote
ICDE
2002
IEEE
16 years 8 months ago
2002
IEEE
As Web applications manipulate an increasing amount of XML, there is a growing interest in storing XML data in relational databases. Due to the mismatch between the complexity of ...
329
click to vote
ICDE
1999
IEEE
16 years 8 months ago
1999
IEEE
Time series stored as feature vectors can be indexed by multidimensional index trees like R-Trees for fast retrieval. Due to the dimensionality curse problem, transformations are ...
248
click to vote
ICDE
1999
IEEE
16 years 8 months ago
1999
IEEE
The ability to model the temporal dimension is essential to many applications. Furthermore, the rate of increase in database size and response time requirements has outpaced advan...
141
click to vote
DAC
2002
ACM
16 years 7 months ago
2002
ACM
In this paper, we present a flexible accelerator designed for networking applications. The accelerator can be utilized efficiently by a variety of Network Processor designs. Most ...
148
click to vote
DAC
2006
ACM
16 years 7 months ago
2006
ACM
Steiner routing is a fundamental yet NP-hard problem in VLSI design and other research fields. In this paper, we propose to model the routing graph by an RC network with routing t...