Sciweavers

3136 search results - page 444 / 628
» Comparison of Clique-Listing Algorithms
Sort
View
ICDT
2001
ACM
147views Database» more  ICDT 2001»
15 years 11 months ago
Parallelizing the Data Cube
This paper presents a general methodology for the efficient parallelization of existing data cube construction algorithms. We describe two different partitioning strategies, one f...
Frank K. H. A. Dehne, Todd Eavis, Susanne E. Hambr...
GLOBECOM
2010
IEEE
15 years 4 months ago
SplitAP: Leveraging Wireless Network Virtualization for Flexible Sharing of WLANs
Providing air-time guarantees across a group of clients forms a fundamental building block in sharing an access point (AP) across different virtual network providers. Though this p...
Gautam D. Bhanage, Dipti Vete, Ivan Seskar, Dipank...
BMCBI
2011
14 years 10 months ago
Elastic SCAD as a novel penalization method for SVM classification tasks in high-dimensional data
Background: Classification and variable selection play an important role in knowledge discovery in highdimensional data. Although Support Vector Machine (SVM) algorithms are among...
Natalia Becker, Grischa Toedt, Peter Lichter, Axel...
BMCBI
2011
14 years 10 months ago
MINE: Module Identification in NEtworks
Background: Graphical models of network associations are useful for both visualizing and integrating multiple types of association data. Identifying modules, or groups of function...
Kahn Rhrissorrakrai, Kristin C. Gunsalus
CAD
2011
Springer
14 years 10 months ago
Principal curvature ridges and geometrically salient regions of parametric B-spline surfaces
Ridges are characteristic curves of a surface that mark salient intrinsic features of its shape and are therefore valuable for shape matching, surface quality control, visualizati...
Suraj Musuvathy, Elaine Cohen, James N. Damon, Joo...