Sciweavers

379 search results - page 6 / 76
» Strong reducibility of partial numberings
Sort
View
HICSS
2003
IEEE
122views Biometrics» more  HICSS 2003»
14 years 27 days ago
On Reducing Broadcast Redundancy in Ad Hoc Wireless Networks
—Unlike in a wired network, a packet transmitted by a node in an ad hoc wireless network can reach all neighbors. Therefore, the total number of transmissions (forward nodes) is ...
Wei Lou, Jie Wu
CIKM
1995
Springer
13 years 11 months ago
Using Speculation to Reduce Server Load and Service Time on the WWW
Speculative service implies that a client's request for a document is serviced by sending, in addition to the document requested, a number of other documents (or pointers the...
Azer Bestavros
IPPS
2007
IEEE
14 years 1 months ago
Decomposing Partial Order Execution Graphs to Improve Message Race Detection
In message-passing parallel applications, messages are not delivered in a strict order. In most applications, the computation results and the set of messages produced during the e...
Basile Schaeli, Sebastian Gerlach, Roger D. Hersch
DATE
2008
IEEE
95views Hardware» more  DATE 2008»
14 years 2 months ago
Improving Constant-Coefficient Multiplier Verification by Partial Product Identification
Constant-coefficient multipliers are fundamental components in digital signal processing and arithmetic-based systems. Their verification, however, remains difficult and time-cons...
Chao-Yue Lai, Chung-Yang Huang, Kei-Yong Khoo
CHES
2000
Springer
114views Cryptology» more  CHES 2000»
13 years 11 months ago
Efficient Generation of Prime Numbers
The generation of prime numbers underlies the use of most public-key schemes, essentially as a major primitive needed for the creation of key pairs or as a computation stage appear...
Marc Joye, Pascal Paillier, Serge Vaudenay