Sciweavers

19320 search results - page 176 / 3864
» On the complexity of computing determinants
Sort
View
ICC
2008
IEEE
121views Communications» more  ICC 2008»
16 years 29 days ago
Low-Complexity Pattern-Eliminating Codes for ISI-Limited Channels
— This paper introduces low-complexity block codes, termed pattern-eliminating codes (PEC), which achieve a potentially large performance improvement over channels with residual ...
Natasa Blitvic, Lizhong Zheng, Vladimir Stojanovic
ICASSP
2007
IEEE
16 years 25 days ago
Oversampled Inverse Complex Lapped Transform Optimization
When an oversampled FIR filter bank structure is used for signal analysis, a main problem is to guarantee its invertibility and to be able to determine an inverse synthesis filt...
Jérôme Gauthier, Laurent Duval, Jean-...
ICDM
2005
IEEE
139views Data Mining» more  ICDM 2005»
16 years 3 days ago
Approximate Inverse Frequent Itemset Mining: Privacy, Complexity, and Approximation
In order to generate synthetic basket data sets for better benchmark testing, it is important to integrate characteristics from real-life databases into the synthetic basket data ...
Yongge Wang, Xintao Wu
IAT
2003
IEEE
15 years 11 months ago
A Two-Level Negotiation Framework for Complex Negotiations
In this paper, we present a negotiation framework in which the negotiation process is performed at two levels. The upper level deals with the formation of high-level goals and obj...
Xiaoqin Zhang, Victor R. Lesser, Thomas Wagner
CCCG
2008
15 years 8 months ago
On the Complexity of Point Recolouring in Geometric Graphs
Given a collection of points representing geographic data we consider the task of delineating boundaries based on the features of the points. Assuming that the features are binary...
Henk Meijer, Yurai Núñez Rodrí...