4411 search results - page 30 / 883 » Communication Complexity and Its Applications |
ASIACRYPT
2000
Springer
14 years 2 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...
VISUALIZATION
1998
IEEE
14 years 2 months ago
1998
IEEE
The key to real-time rendering of large-scale surfaces is to locally adapt surface geometric complexity to changing view parameters. Several schemes have been developed to address...
BIBE
2004
IEEE
14 years 1 months ago
2004
IEEE
Clustering has been one of the most popular methods to discover useful biological insights from DNA microarray. An interesting paradigm is simultaneous clustering of both genes an...
PE
2007
Springer
13 years 9 months ago
2007
Springer
To develop simple traffic engineering rules for the downlink of a cellular system using Proportional Fairness (PF) scheduling, we study the “strict” and “approximate” ins...
SODA
2012
ACM
12 years 9 days ago
2012
ACM
We give a deterministic O(log n)n -time and space algorithm for the Shortest Vector Problem (SVP) of a lattice under any norm, improving on the previous best deterministic nO(n) -...