Sciweavers

2107 search results - page 282 / 422
» Computing Small Search Numbers in Linear Time
Sort
View
COCO
2009
Springer
113views Algorithms» more  COCO 2009»
14 years 1 months ago
Extractors for Low-Weight Affine Sources
We give polynomial time computable extractors for low-weight affince sources. A distribution is affine if it samples a random points from some unknown low dimensional subspace of ...
Anup Rao
ACNS
2006
Springer
87views Cryptology» more  ACNS 2006»
14 years 26 days ago
Effect of Malicious Synchronization
Abstract. We study the impact of malicious synchronization on computer systems that serve customers periodically. Systems supporting automatic periodic updates are common in web se...
Mun Choon Chan, Ee-Chien Chang, Liming Lu, Peng So...
BROADNETS
2004
IEEE
14 years 27 days ago
A Scalable Algorithm for Survivable Routing in IP-Over-WDM Networks
In IP-over-WDM networks, a logical IP network has to be routed on top of a physical optical fiber network. An important challenge hereby is to make the routing survivable. We call...
Frederick Ducatelle, Luca Maria Gambardella
ICS
2000
Tsinghua U.
14 years 23 days ago
A low-complexity issue logic
One of the main concerns in today's processor design is the issue logic. Instruction-level parallelism is usually favored by an out-of-order issue mechanism where instruction...
Ramon Canal, Antonio González
ICCAD
1995
IEEE
134views Hardware» more  ICCAD 1995»
14 years 22 days ago
A delay model for logic synthesis of continuously-sized networks
ng certain electrical noise and power constraints.Abstract: We present a new delay model for use in logic synthesis. A traditional model treats the area of a library cell as consta...
Joel Grodstein, Eric Lehman, Heather Harkness, Bil...