Sciweavers

2165 search results - page 261 / 433
» cases 2005
Sort
View
PERCOM
2005
ACM
16 years 5 months ago
When Does Opportunistic Routing Make Sense?
Different opportunistic routing protocols have been proposed recently for routing in sensor networks. These protocols exploit the redundancy among nodes by using a node that is av...
Adam Wolisz, Jan M. Rabaey, Rahul C. Shah, Sven Wi...
DCC
2005
IEEE
16 years 5 months ago
Highly Nonlinear Resilient Functions Through Disjoint Codes in Projective Spaces
Functions which map n-bits to m-bits are important cryptographic sub-primitives in the design of additive stream ciphers. We construct highly nonlinear t-resilient such functions (...
Pascale Charpin, Enes Pasalic
ICCAD
2005
IEEE
144views Hardware» more  ICCAD 2005»
16 years 2 months ago
An exact algorithm for the maximal sharing of partial terms in multiple constant multiplications
— In this paper we propose an exact algorithm that maximizes the sharing of partial terms in Multiple Constant Multiplication (MCM) operations. We model this problem as a Boolean...
Paulo F. Flores, José C. Monteiro, Eduardo ...
ICCAD
2005
IEEE
176views Hardware» more  ICCAD 2005»
16 years 2 months ago
Statistical gate sizing for timing yield optimization
— Variability in the chip design process has been relatively increasing with technology scaling to smaller dimensions. Using worst case analysis for circuit optimization severely...
Debjit Sinha, Narendra V. Shenoy, Hai Zhou
ICCAD
2005
IEEE
106views Hardware» more  ICCAD 2005»
16 years 2 months ago
New decompilation techniques for binary-level co-processor generation
—Existing ASIPs (application-specific instruction-set processors) and compiler-based co-processor synthesis approaches meet the increasing performance requirements of embedded ap...
Greg Stiff, Frank Vahid