Sciweavers

4908 search results - page 25 / 982
» On the Complexity of Optimal K-Anonymity
Sort
View
CORR
2010
Springer
110views Education» more  CORR 2010»
15 years 2 months ago
Detecting communities of triangles in complex networks using spectral optimization
The study of the sub-structure of complex networks is of major importance to relate topology and functionality. Many efforts have been devoted to the analysis of the modular struc...
Belkacem Serrour, Alex Arenas, Sergio Gómez
VTC
2006
IEEE
104views Communications» more  VTC 2006»
15 years 8 months ago
Low-Complexity Optimal Detection for Hybrid Space-Time Block Coding and Spatial Multiplexing
— The combination of space-time block codes (STBC) and spatial multiplexing (SM) schemes has the advantages of diversity gain and high data rate. For such STBC/SM hybrid systems,...
Yue Wu, Chintha Tellambura
115
Voted
JUCS
2008
151views more  JUCS 2008»
15 years 1 months ago
The Bit-Complexity of Finding Nearly Optimal Quadrature Rules for Weighted Integration
: Given a probability measure and a positive integer n. How to choose n knots and n weights such that the corresponding quadrature rule has the minimum worst-case error when appli...
Volker Bosserhoff
ICIP
2003
IEEE
16 years 3 months ago
Towards objective performance analysis for estimation of complex motion: analytic motion modeling, filter optimization, and test
This paper deals with several aspects towards a more objective performance analysis of low-level motion analysis. A generalized spatiotemporal filter formulation and motion modeli...
Bernd Jähne, Christoph S. Garbe
SMA
2005
ACM
167views Solid Modeling» more  SMA 2005»
15 years 7 months ago
Boolean operations on 3D selective Nef complexes: optimized implementation and experiments
Nef polyhedra in d-dimensional space are the closure of half-spaces under boolean set operation. In consequence, they can represent non-manifold situations, open and closed sets, ...
Peter Hachenberger, Lutz Kettner