Sciweavers

425 search results - page 10 / 85
» Polynomial Time Data Reduction for Dominating Set
Sort
View
COLT
1993
Springer
15 years 1 months ago
Parameterized Learning Complexity
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...
Rodney G. Downey, Patricia A. Evans, Michael R. Fe...
JAR
2007
142views more  JAR 2007»
14 years 9 months ago
Reasoning in Description Logics by a Reduction to Disjunctive Datalog
As applications of description logics proliferate, efficient reasoning with knowledge bases containing many assertions becomes ever more important. For such cases, we developed a n...
Ullrich Hustadt, Boris Motik, Ulrike Sattler
JMLR
2010
161views more  JMLR 2010»
14 years 4 months ago
Training and Testing Low-degree Polynomial Data Mappings via Linear SVM
Kernel techniques have long been used in SVM to handle linearly inseparable problems by transforming data to a high dimensional space, but training and testing large data sets is ...
Yin-Wen Chang, Cho-Jui Hsieh, Kai-Wei Chang, Micha...
VIS
2007
IEEE
128views Visualization» more  VIS 2007»
15 years 10 months ago
Modeling Perceptual Dominance Among Visual Cues in Multilayered Icon-based Scientific Visualizations
ization method is an abstract function that transforms a scientific dataset into a visual representation to facilitate data exploration. In turn, a visualization display is the vis...
Daniel Acevedo, Jian Chen, David H. Laidlaw
IS
2010
14 years 7 months ago
Extracting a largest redundancy-free XML storage structure from an acyclic hypergraph in polynomial time
Given a hypergraph and a set of embedded functional dependencies, we investigate the problem of determining the conditions under which we can efficiently generate redundancy-free ...
Wai Yin Mok, Joseph Fong, David W. Embley