Sciweavers

903 search results - page 146 / 181
» On the reduction of a random basis
Sort
View
70
Voted
HT
1991
ACM
15 years 1 months ago
Implementing Hypertext Database Relationships through Aggregations and Exceptions
In order to combine hypertext with database facilities, we show how to extract an effective storage structure from given instance relationships. The schema of the structure recogn...
Yoshinori Hara, Arthur M. Keller, Gio Wiederhold
114
Voted
FPGA
2010
ACM
181views FPGA» more  FPGA 2010»
15 years 1 months ago
Efficient multi-ported memories for FPGAs
Multi-ported memories are challenging to implement with FPGAs since the provided block RAMs typically have only two ports. We present a thorough exploration of the design space of...
Charles Eric LaForest, J. Gregory Steffan
CDC
2009
IEEE
183views Control Systems» more  CDC 2009»
15 years 1 months ago
Algorithms and stability analysis for content distribution over multiple multicast trees
Abstract— The paper investigates theoretical issues in applying the universal swarming technique to efficient content distribution. In a swarming session, a file is distributed...
Xiaoying Zheng, Chunglae Cho, Ye Xia
102
Voted
CHES
2008
Springer
146views Cryptology» more  CHES 2008»
15 years 7 days ago
Power and Fault Analysis Resistance in Hardware through Dynamic Reconfiguration
Dynamically reconfigurable systems are known to have many advantages such as area and power reduction. The drawbacks of these systems are the reconfiguration delay and the overhead...
Nele Mentens, Benedikt Gierlichs, Ingrid Verbauwhe...
80
Voted
ICALP
2010
Springer
15 years 6 days ago
How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange)
Gossip protocols, also known as epidemic dissemination schemes, are becoming increasingly popular in distributed systems. Yet, it has remained a partially open question to determin...
Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Mort...