Sciweavers

715 search results - page 106 / 143
» On graphs with subgraphs having large independence numbers
Sort
View
IISWC
2009
IEEE
14 years 3 months ago
Experimental evaluation of N-tier systems: Observation and analysis of multi-bottlenecks
In many areas such as e-commerce, mission-critical N-tier applications have grown increasingly complex. They are characterized by non-stationary workloads (e.g., peak load several...
Simon Malkowski, Markus Hedwig, Calton Pu
IACR
2011
212views more  IACR 2011»
12 years 8 months ago
Fully Homomorphic Encryption without Bootstrapping
We present a radically new approach to fully homomorphic encryption (FHE) that dramatically improves performance and bases security on weaker assumptions. A central conceptual con...
Zvika Brakerski, Craig Gentry, Vinod Vaikuntanatha...
SODA
2008
ACM
110views Algorithms» more  SODA 2008»
13 years 10 months ago
Why simple hash functions work: exploiting the entropy in a data stream
Hashing is fundamental to many algorithms and data structures widely used in practice. For theoretical analysis of hashing, there have been two main approaches. First, one can ass...
Michael Mitzenmacher, Salil P. Vadhan
ICCAD
2009
IEEE
136views Hardware» more  ICCAD 2009»
13 years 6 months ago
A hierarchical floating random walk algorithm for fabric-aware 3D capacitance extraction
With the adoption of ultra regular fabric paradigms for controlling design printability at the 22nm node and beyond, there is an emerging need for a layout-driven, pattern-based p...
Tarek A. El-Moselhy, Ibrahim M. Elfadel, Luca Dani...
AINA
2010
IEEE
14 years 1 months ago
Routing Loops in DAG-Based Low Power and Lossy Networks
Abstract—Directed Acyclic Graphs (DAGs), rooted at popular/default destinations, have emerged as a preferred mechanism to provide IPv6 routing functionality in large scale low po...
Weigao Xie, Mukul Goyal, Hossein Hosseini, Jerald ...