Sciweavers

3946 search results - page 168 / 790
» The computational complexity of choice sets
Sort
View
QSHINE
2005
IEEE
16 years 18 days ago
Adaptive Low-Complexity Erasure-Correcting Code-Based Protocols for QoS-Driven Mobile Multicast Services
—We propose an adaptive hybrid automatic repeat request–forward error correction (ARQ–FEC) erasure-correcting scheme for quality of service (QoS)-driven mobile multicast serv...
Qinghe Du, Xi Zhang
234
Voted
SDM
2012
SIAM
297views Data Mining» more  SDM 2012»
13 years 9 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ç,...
193
Voted
BIODATAMINING
2008
96views more  BIODATAMINING 2008»
15 years 7 months ago
Fast approximate hierarchical clustering using similarity heuristics
Background: Agglomerative hierarchical clustering (AHC) is a common unsupervised data analysis technique used in several biological applications. Standard AHC methods require that...
Meelis Kull, Jaak Vilo
223
Voted
IPPS
2003
IEEE
16 years 9 days ago
Constrained Component Deployment in Wide-Area Networks Using AI Planning Techniques
Component-based models represent a dominant trend in the construction of wide-area network applications, making possible the integration of diverse functionality contained in modu...
Tatiana Kichkaylo, Anca-Andreea Ivan, Vijay Karamc...
195
Voted
WS
2010
ACM
15 years 5 months ago
Semantic web enabled software analysis
One of the most important decisions researchers face when analyzing software systems is the choice of a proper data analysis/exchange format. In this paper, we present EvoOnt, a s...
Jonas Tappolet, Christoph Kiefer, Abraham Bernstei...