219 search results - page 42 / 44 » Optimal dyadic decision trees |
VLDB
2005
ACM
14 years 3 months ago
2005
ACM
Many enterprise applications prefer to store XML data as a rich data type, i.e. a sequence of bytes, in a relational database system to avoid the complexity of decomposing the dat...
COR
2006
13 years 10 months ago
2006
Discretization is defined as the process that divides continuous numeric values into intervals of discrete categorical values. In this article, the concept of cost-based discretiz...
ANCS
2009
ACM
13 years 8 months ago
2009
ACM
Ubiquitous multi-core-based web servers and edge routers are increasingly popular in deploying computationally intensive Deep Packet Inspection (DPI) programs. Previous work has s...
ICDE
2003
IEEE
14 years 11 months ago
2003
IEEE
We present a query architecture in which join operators are decomposed into their constituent data structures (State Modules, or SteMs), and dataflow among these SteMs is managed ...
SAGA
2009
Springer
14 years 4 months ago
2009
Springer
We propose a generic method for obtaining quickly good upper bounds on the minimal value of a multistage stochastic program. The method is based on the simulation of a feasible dec...