Sciweavers

970 search results - page 15 / 194
» case 2011
Sort
View
JCT
2011
84views more  JCT 2011»
13 years 2 months ago
Explicit separating invariants for cyclic P-groups
Abstract. We consider a finite dimensional indecomposable modular representation of a cyclic p-group and we give a recursive description of an associated separating set: We show t...
Müfit Sezer
TCOM
2011
108views more  TCOM 2011»
13 years 2 months ago
Computational Complexity of Decoding Orthogonal Space-Time Block Codes
— The computational complexity of optimum decoding for an orthogonal space-time block code is quantified. Four equivalent techniques of optimum decoding which have the same comp...
Ender Ayanoglu, Erik G. Larsson, Eleftherios Karip...
ECCC
2011
223views ECommerce» more  ECCC 2011»
13 years 2 months ago
A Case of Depth-3 Identity Testing, Sparse Factorization and Duality
Polynomial identity testing (PIT) problem is known to be challenging even for constant depth arithmetic circuits. In this work, we study the complexity of two special but natural ...
Chandan Saha, Ramprasad Saptharishi, Nitin Saxena
CVPR
2011
IEEE
13 years 3 months ago
Adapting an Object Detector by Considering the Worst Case: a Conservative Approach
The performance of an offline-trained classifier can be improved on-site by adapting the classifier towards newly acquired data. However, the adaptation rate is a tuning parame...
Guang Chen, TonyX. Han
JCDL
2011
ACM
301views Education» more  JCDL 2011»
12 years 10 months ago
Archiving the web using page changes patterns: a case study
A pattern is a model or a template used to summarize and describe the behavior (or the trend) of a data having generally some recurrent events. Patterns have received a considerab...
Myriam Ben Saad, Stéphane Gançarski