Sciweavers

4192 search results - page 154 / 839
» Efficient testing of groups
Sort
View
ISSAC
1995
Springer
93views Mathematics» more  ISSAC 1995»
15 years 4 months ago
Finding Roots of Unity Among Quotients of the Roots of an Integral Polynomial
We present an efficient algorithm for testing whether a given integral polynomial has two distinct roots a, B such that fflp is a root of unity. The test is based on results obtai...
Kazuhiro Yokoyama, Ziming Li, István Nemes
131
Voted
ANTS
2010
Springer
216views Algorithms» more  ANTS 2010»
15 years 4 months ago
Efficient Pairing Computation with Theta Functions
In this paper, we present a new approach based on theta functions to compute Weil and Tate pairings. A benefit of our method, which does not rely on the classical Miller's alg...
David Lubicz, Damien Robert
ICIP
2001
IEEE
16 years 2 months ago
Efficient fine granular scalable video coding
In this work we present an efficient fine granular scalable video compression scheme which supports a fast bit rate adaptation independent of the encoder. The proposed scheme gene...
Christian Buchner, Thomas Stockhammer, Detlev Marp...
145
Voted
PERCOM
2006
ACM
16 years 10 days ago
CAPS: Energy-Efficient Processing of Continuous Aggregate Queries in Sensor Networks
In this paper, we design and evaluate an energy efficient data retrieval architecture for continuous aggregate queries in wireless sensor networks. We show how the modification of...
Wen Hu, Archan Misra, Rajeev Shorey
ICC
2007
IEEE
128views Communications» more  ICC 2007»
15 years 7 months ago
An Efficient Selective Receiver for STBC Scheme
—In this paper, we propose an efficient selective receiver for space-time block coding (STBC) scheme. In this proposed scheme, we divide the received signals into two groups. By ...
Lijun Liu, Sooyoung Kim, Myoung-Seob Lim