Sciweavers

721 search results - page 61 / 145
» Graphs with Large Obstacle Numbers
Sort
View
CLOUDCOM
2010
Springer
13 years 7 months ago
A Token-Based Access Control System for RDF Data in the Clouds
The Semantic Web is gaining immense popularity-and with it, the Resource Description Framework (RDF) broadly used to model Semantic Web content. However, access control on RDF sto...
Arindam Khaled, Mohammad Farhan Husain, Latifur Kh...
BMCBI
2006
142views more  BMCBI 2006»
13 years 9 months ago
Improving the Performance of SVM-RFE to Select Genes in Microarray Data
Background: Recursive Feature Elimination is a common and well-studied method for reducing the number of attributes used for further analysis or development of prediction models. ...
Yuanyuan Ding, Dawn Wilkins
DCC
2005
IEEE
14 years 8 months ago
The Combinatorics of Dom de Caen
We give an overview of some of the mathematical results of Dominique de Caen. These include a short proof of K?onig's theorem, results on Tur?an numbers, biclique partitions,...
Edwin R. van Dam
LATIN
2010
Springer
14 years 4 months ago
Kernelization through Tidying
Abstract. We introduce the NP-hard graph-based data clustering problem s-Plex Cluster Vertex Deletion, where the task is to delete at most k vertices from a graph so that the conne...
René van Bevern, Hannes Moser, Rolf Niederm...
CSMR
2008
IEEE
14 years 3 months ago
Hecataeus: A What-If Analysis Tool for Database Schema Evolution
Databases are continuously evolving environments, where design constructs are added, removed or updated rather often. Small changes in the database configurations might impact a l...
George Papastefanatos, Fotini Anagnostou, Yannis V...