976 search results - page 23 / 196 » The Complexity of Timetable Construction Problems |
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
This paper considers the problem of construction of low-pass filters on the unit sphere, which has wide ranging applications in the processing of signals on the unit sphere. We p...
CADE
2006
Springer
14 years 7 months ago
2006
Springer
Abstract. We extend our previous study of the automatic construction of isomorphic classification theorems for algebraic domains by considering the isotopy equivalence relation. Is...
ASIACRYPT
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. Construction of secure hyperelliptic curves is of most important yet most difficult problem in design of cryptosystems based on the discrete logarithm problems on hyperel...
ECIS
2004
13 years 8 months ago
2004
Globalization has seen the emergence of virtual teams solving complex organisational problems using computer-mediated technologies. By extending Media Richness Theory, it was the ...
MOC
2002
13 years 7 months ago
2002
In this paper, we present several baby-step giant-step algorithms for the low hamming weight discrete logarithm problem. In this version of the discrete log problem, we are require...