Sciweavers

5244 search results - page 872 / 1049
» Structural Complexity of AvgBPP
Sort
View
STOC
2003
ACM
188views Algorithms» more  STOC 2003»
16 years 5 months ago
Almost random graphs with simple hash functions
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
Martin Dietzfelbinger, Philipp Woelfel
PODS
2002
ACM
167views Database» more  PODS 2002»
16 years 5 months ago
OLAP Dimension Constraints
In multidimensional data models intended for online analytic processing (OLAP), data are viewed as points in a multidimensional space. Each dimension has structure, described by a...
Carlos A. Hurtado, Alberto O. Mendelzon
130
Voted
ISCA
2007
IEEE
130views Hardware» more  ISCA 2007»
15 years 11 months ago
Dynamic prediction of architectural vulnerability from microarchitectural state
Transient faults due to particle strikes are a key challenge in microprocessor design. Driven by exponentially increasing transistor counts, per-chip faults are a growing burden. ...
Kristen R. Walcott, Greg Humphreys, Sudhanva Gurum...
IWQOS
2004
Springer
15 years 10 months ago
Small world overlay P2P networks
In this paper, we consider how to “construct” and “maintain” an overlay structured P2P network based on the “smallworld paradigm”. Two main attractive properties of a ...
Ken Y. K. Hui, John C. S. Lui, David K. Y. Yau
ICADL
2003
Springer
140views Education» more  ICADL 2003»
15 years 10 months ago
LVS Digital Library Cluster with Fair Memory Utilization
A digital library system consists of LVS(Linux Virtual Server) operating with software clustering technology provides is designed on Linux environment. In the cluster of servers fa...
MinHwan Ok, Kyeongmo Kang, Myong-Soon Park