Sciweavers

163 search results - page 4 / 33
» Data structures and algorithms for simplifying reversible ci...
Sort
View
INFOCOM
2006
IEEE
14 years 1 months ago
Reverse Hashing for High-Speed Network Monitoring: Algorithms, Evaluation, and Applications
— A key function for network traffic monitoring and analysis is the ability to perform aggregate queries over multiple data streams. Change detection is an important primitive w...
Robert T. Schweller, Zhichun Li, Yan Chen, Yan Gao...
FUN
2010
Springer
230views Algorithms» more  FUN 2010»
13 years 11 months ago
O(1)-Time Unsorting by Prefix-Reversals in a Boustrophedon Linked List
Conventional wisdom suggests that O(k)-time is required to reverse a substring of length k. To reduce this time complexity, a simple and unorthodox data structure is introduced. A ...
Aaron Williams
INFOCOM
2009
IEEE
14 years 2 months ago
Circuits/Cutsets Duality and a Unified Algorithmic Framework for Survivable Logical Topology Design in IP-over-WDM Optical Netwo
: Given a logical topology and a physical topology , the survivable logical topology design problem in an IP-overWDM optical network is to map the logical links into lightpaths in ...
Krishnaiyan Thulasiraman, Muhammad S. Javed, Guoli...
INFOCOM
2011
IEEE
12 years 11 months ago
Dynamic right-sizing for power-proportional data centers
—Power consumption imposes a significant cost for data centers implementing cloud services, yet much of that power is used to maintain excess service capacity during periods of ...
Minghong Lin, Adam Wierman, Lachlan L. H. Andrew, ...
CARDIS
2004
Springer
97views Hardware» more  CARDIS 2004»
14 years 1 months ago
On the Security of the DeKaRT Primitive
DeKaRT primitives are key-dependent reversible circuits presented at CHES 2003. According to the author, the circuits described are suitable for data scrambling but also as buildin...
Gilles Piret, François-Xavier Standaert, Ga...