Sciweavers

301 search results - page 53 / 61
» On Finding Dense Subgraphs
Sort
View
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
15 years 10 months ago
Efficient closed pattern mining in the presence of tough block constraints
In recent years, various constrained frequent pattern mining problem formulations and associated algorithms have been developed that enable the user to specify various itemsetbase...
Krishna Gade, Jianyong Wang, George Karypis
AUSAI
2005
Springer
15 years 3 months ago
K-Optimal Pattern Discovery: An Efficient and Effective Approach to Exploratory Data Mining
Most data-mining techniques seek a single model that optimizes an objective function with respect to the data. In many real-world applications several models will equally optimize...
Geoffrey I. Webb
UAI
2004
14 years 11 months ago
Recovering Articulated Object Models from 3D Range Data
We address the problem of unsupervised learning of complex articulated object models from 3D range data. We describe an algorithm whose input is a set of meshes corresponding to d...
Dragomir Anguelov, Daphne Koller, Hoi-Cheung Pang,...
93
Voted
CONEXT
2009
ACM
14 years 10 months ago
ARES: an anti-jamming reinforcement system for 802.11 networks
Dense, unmanaged 802.11 deployments tempt saboteurs into launching jamming attacks by injecting malicious interference. Nowadays, jammers can be portable devices that transmit int...
Konstantinos Pelechrinis, Ioannis Broustis, Srikan...
BMCBI
2010
155views more  BMCBI 2010»
14 years 9 months ago
FunctSNP: an R package to link SNPs to functional knowledge and dbAutoMaker: a suite of Perl scripts to build SNP databases
Background: Whole genome association studies using highly dense single nucleotide polymorphisms (SNPs) are a set of methods to identify DNA markers associated with variation in a ...
Stephen J. Goodswen, Cedric Gondro, Nathan S. Wats...