Sciweavers

6568 search results - page 37 / 1314
» Reducing the Complexity of Reductions
Sort
View
ICDM
2006
IEEE
118views Data Mining» more  ICDM 2006»
15 years 5 months ago
Reducing the Frequent Pattern Set
One of the major problems in frequent pattern mining is the explosion of the number of results, making it difficult to identify the interesting frequent patterns. In a recent pap...
Ronnie Bathoorn, Arne Koopman, Arno Siebes
ICPR
2002
IEEE
16 years 28 days ago
Object Detection in Images: Run-Time Complexity and Parameter Selection of Support Vector Machines
In this paper we address two aspects related to the exploitation of Support Vector Machines (SVM) for classification in real application domains, such as the detection of objects ...
Nicola Ancona, Grazia Cicirelli, Ettore Stella, Ar...
ICHIT
2009
Springer
15 years 6 months ago
An improved camera identification method based on the texture complexity and the image restoration
The identification of source camera is useful to improve the capability of evidence in the digital image such as distinguish the photographer taking illegal images and adopting di...
Kazuya Matsushita, Hitoshi Kitazawa
CCECE
2006
IEEE
15 years 5 months ago
Group-Optimal Linear Space-Time Multiuser Detection
Multiuser detection (MUD) techniques are known to improve the performance of CDMA cellular communication systems. This performance improvement usually comes at a large computation...
Benoit Pelletier, Benoît Champagne
TLCA
2009
Springer
15 years 6 months ago
On the Values of Reducibility Candidates
The straightforward elimination of union types is known to break subject reduction, and for some extensions of the lambda-calculus, to break strong normalization as well. Similarly...
Colin Riba