Sciweavers

3405 search results - page 71 / 681
» Factoring Groups Efficiently
Sort
View
NIPS
2004
15 years 7 months ago
Efficient Out-of-Sample Extension of Dominant-Set Clusters
Dominant sets are a new graph-theoretic concept that has proven to be relevant in pairwise data clustering problems, such as image segmentation. They generalize the notion of a ma...
Massimiliano Pavan, Marcello Pelillo
CORR
2010
Springer
139views Education» more  CORR 2010»
15 years 6 months ago
Fast Overlapping Group Lasso
The group Lasso is an extension of the Lasso for feature selection on (predefined) non-overlapping groups of features. The non-overlapping group structure limits its applicability...
Jun Liu, Jieping Ye
SUTC
2006
IEEE
16 years 8 days ago
Performance Characteristics of Region-Based Group Key Management in Mobile Ad Hoc Networks
We propose and analyze a scalable and efficient region-based group key management protocol for secure group communications in mobile ad hoc networks. For scalability and dynamic r...
Ing-Ray Chen, Jin-Hee Cho, Ding-Chau Wang
PE
2008
Springer
139views Optimization» more  PE 2008»
15 years 6 months ago
Performance optimization of region-based group key management in mobile ad hoc networks
We propose and analyze a scalable and efficient region-based group key management protocol for secure group communications in mobile ad hoc networks. For scalability and dynamic r...
Jin-Hee Cho, Ing-Ray Chen, Ding-Chau Wang
EDBT
2008
ACM
124views Database» more  EDBT 2008»
16 years 6 months ago
An efficient clustering method for k-anonymization
The k-anonymity model is a privacy-preserving approach that has been extensively studied for the past few years. To minimize the information loss due to anonymization, it is cruci...
Jun-Lin Lin, Meng-Cheng Wei