2208 search results - page 380 / 442 » On Issues of Instance Selection |
COCO
2004
Springer
14 years 1 months ago
2004
Springer
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
EDBT
2010
ACM
14 years 1 months ago
2010
ACM
Online Analytical Processing (OLAP) is a popular technique for explorative data analysis. Usually, a fixed set of dimensions (such as time, place, etc.) is used to explore and ana...
VDA
2010
14 years 11 days ago
2010
While there have been intensive efforts in developing better 3D flow visualization techniques, little attention has been paid to the design of better user interfaces and more effe...
PAKDD
2010
ACM
13 years 12 months ago
2010
ACM
We present ActMiner, which addresses four major challenges to data stream classification, namely, infinite length, concept-drift, conceptevolution, and limited labeled data. Most o...
DLOG
2001
13 years 11 months ago
2001
For description logics with existential restrictions, the size of the least common subsumer (lcs) of concept descriptions may grow exponentially in the size of the concept descrip...