Sciweavers

1403 search results - page 124 / 281
» Set cover algorithms for very large datasets
Sort
View
ICIP
2010
IEEE
15 years 2 months ago
Fast object detection using boosted co-occurrence histograms of oriented gradients
Co-occurrence histograms of oriented gradients (CoHOG) are powerful descriptors in object detection. In this paper, we propose to utilize a very large pool of CoHOG features with ...
Haoyu Ren, Cher-Keng Heng, Wei Zheng, Luhong Liang...
ICWS
2009
IEEE
15 years 2 months ago
A Dynamic Approach toward QoS-Aware Service Workflow Composition
Web service-based workflow management systems have garnered considerable attention for automating and scheduling dependent operations. Such systems often support user preferences,...
David Chiu, Sagar Deshpande, Gagan Agrawal, Rongxi...
TNN
2010
173views Management» more  TNN 2010»
14 years 11 months ago
Multiclass relevance vector machines: sparsity and accuracy
Abstract--In this paper we investigate the sparsity and recognition capabilities of two approximate Bayesian classification algorithms, the multi-class multi-kernel Relevance Vecto...
Ioannis Psorakis, Theodoros Damoulas, Mark A. Giro...
150
Voted
WWW
2007
ACM
16 years 5 months ago
SPARQ2L: towards support for subgraph extraction queries in rdf databases
Many applications in analytical domains often have the need to "connect the dots" i.e., query about the structure of data. In bioinformatics for example, it is typical t...
Kemafor Anyanwu, Angela Maduko, Amit P. Sheth
175
Voted
SDM
2012
SIAM
297views Data Mining» more  SDM 2012»
13 years 7 months ago
A Flexible Open-Source Toolbox for Scalable Complex Graph Analysis
The Knowledge Discovery Toolbox (KDT) enables domain experts to perform complex analyses of huge datasets on supercomputers using a high-level language without grappling with the ...
Adam Lugowski, David M. Alber, Aydin Buluç,...