Sciweavers

3415 search results - page 409 / 683
» Lower bounds on kernelization
Sort
View
146
Voted
ICALP
2005
Springer
16 years 4 days ago
Quantum Complexity of Testing Group Commutativity
We consider the problem of testing the commutativity of a black-box group specified by its k generators. The complexity (in terms of k) of this problem was first considered by Pa...
Frédéric Magniez, Ashwin Nayak
ICAPR
2005
Springer
16 years 4 days ago
Texture Exemplars for Defect Detection on Random Textures
We present a new approach to detecting defects in random textures which requires only very few defect free samples for unsupervised training. Each product image is divided into ove...
Xianghua Xie, Majid Mirmehdi
ICCS
2005
Springer
16 years 4 days ago
Highly Scalable Algorithms for Robust String Barcoding
: String barcoding is a recently introduced technique for genomic based identification of microorganisms. In this paper we describe the engineering of highly scalable algorithms fo...
Bhaskar DasGupta, Kishori M. Konwar, Ion I. Mandoi...
ICTCS
2005
Springer
16 years 3 days ago
Laxity Helps in Broadcast Scheduling
We study the effect of laxity, or slack time, on the online scheduling of broadcasts with deadlines. The laxity of a request is defined to be the ratio between its span (differe...
Stanley P. Y. Fung, Francis Y. L. Chin, Chung Keun...
INDOCRYPT
2005
Springer
16 years 3 days ago
On Highly Nonlinear S-Boxes and Their Inability to Thwart DPA Attacks
Prouff has introduced recently, at FSE 2005, the notion of transparency order of S-boxes. This new characteristic is related to the ability of an S-box, used in a cryptosystem in ...
Claude Carlet