Sciweavers

523 search results - page 100 / 105
» On the Signal Bounding Problem in Timing Analysis
Sort
View
MOC
2010
14 years 6 months ago
The number field sieve for integers of low weight
We define the weight of an integer N to be the smallest w such that N can be represented as w i=1 i2ci , with 1,..., w{1,-1}. Since arithmetic modulo a prime of low weight is parti...
Oliver Schirokauer
COMPGEOM
2010
ACM
15 years 4 months ago
A kinetic triangulation scheme for moving points in the plane
We present a simple randomized scheme for triangulating a set P of n points in the plane, and construct a kinetic data structure which maintains the triangulation as the points of...
Haim Kaplan, Natan Rubin, Micha Sharir
CN
2007
117views more  CN 2007»
14 years 11 months ago
Secure multicast in dynamic environments
A secure multicast framework should only allow authorized members of a group to decrypt received messages; usually, one ‘‘group key’’ is shared by all approved members. Ho...
Chun-Ying Huang, Yun-Peng Chiu, Kuan-Ta Chen, Chin...
JACM
2006
99views more  JACM 2006»
14 years 11 months ago
Finding a maximum likelihood tree is hard
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
Benny Chor, Tamir Tuller
TMC
2012
13 years 2 months ago
Relay-Assisted Transmission with Fairness Constraint for Cellular Networks
Abstract—We consider the problem of relay-assisted transmission for cellular networks. In the considered system, a source node together with n relay nodes are selected in a propo...
Erwu Liu, Qinqing Zhang, Kin K. Leung