Sciweavers

2996 search results - page 169 / 600
» Numberings and Randomness
Sort
View
TMC
2010
109views more  TMC 2010»
15 years 4 months ago
On the Performance Bounds of Practical Wireless Network Coding
—Network coding is an attracting technology that has been shown to be able to improve the throughput of wireless networks. However, there still lacks fundamental understanding on...
Jilin Le, John C. S. Lui, Dah-Ming Chiu
WALCOM
2010
IEEE
290views Algorithms» more  WALCOM 2010»
16 years 18 days ago
The Covert Set-Cover Problem with Application to Network Discovery
We address a version of the set-cover problem where we do not know the sets initially (and hence referred to as covert) but we can query an element to find out which sets contain ...
Sandeep Sen, V. N. Muralidhara
DELTA
2008
IEEE
16 years 2 days ago
High Performance FPGA Implementation of the Mersenne Twister
Efficient generation of random and pseudorandom sequences is of great importance to a number of applications [4]. In this paper, an efficient implementation of the Mersenne Twis...
Shrutisagar Chandrasekaran, Abbes Amira
SAC
2008
ACM
15 years 5 months ago
A biologically inspired generation of virtual characters
A number of techniques for generating geometric models of human head and body are in use nowadays. Models of human characters are useful in computer games, virtual reality, and ma...
Roberto C. Cavalcante Vieira, Creto Augusto Vidal,...
153
Voted
STOC
1996
ACM
118views Algorithms» more  STOC 1996»
15 years 9 months ago
Characterizing Linear Size Circuits in Terms of Privacy
In this paper we prove a perhaps unexpected relationship between the complexity class of the boolean functions that have linear size circuits, and n-party private protocols. Speci...
Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosé...