Sciweavers

16404 search results - page 313 / 3281
» A set coverage problem
Sort
View
IMC
2007
ACM
15 years 6 months ago
Acyclic type-of-relationship problems on the internet: an experimental analysis
An experimental study of the feasibility and accuracy of the acyclicity approach introduced in [14] for the inference of business relationships among autonomous systems (ASes) is ...
Benjamin Hummel, Sven Kosub
ISCI
2008
124views more  ISCI 2008»
15 years 4 months ago
A weighted rough set based method developed for class imbalance learning
In this paper, we introduce weights into Pawlak rough set model to balance the class distribution of a data set and develop a weighted rough set based method to deal with the clas...
Jinfu Liu, Qinghua Hu, Daren Yu
MHCI
2009
Springer
15 years 11 months ago
Studying multi-user settings for pervasive games
Whenever a pervasive game has to be developed for a group of children an appropriate multi-user setting has to be found. If the pervasive game does not support the children with a...
Karin Leichtenstern, Elisabeth André
134
Voted
ACTA
2006
104views more  ACTA 2006»
15 years 4 months ago
Safe projections of binary data sets
Abstract Selectivity estimation of a boolean query based on frequent itemsets can be solved by describing the problem by a linear program. However, the number of variables in the e...
Nikolaj Tatti
ADMA
2009
Springer
142views Data Mining» more  ADMA 2009»
15 years 11 months ago
Crawling Deep Web Using a New Set Covering Algorithm
Abstract. Crawling the deep web often requires the selection of an appropriate set of queries so that they can cover most of the documents in the data source with low cost. This ca...
Yan Wang, Jianguo Lu, Jessica Chen