Sciweavers

1507 search results - page 245 / 302
» Separating Complexity Classes Using Structural Properties
Sort
View
SODA
2000
ACM
114views Algorithms» more  SODA 2000»
14 years 3 days ago
Typical random 3-SAT formulae and the satisfiability threshold
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...
Olivier Dubois, Yacine Boufkhad, Jacques Mandler
TON
2010
198views more  TON 2010»
13 years 5 months ago
On Wireless Scheduling Algorithms for Minimizing the Queue-Overflow Probability
Abstract-- In this paper, we are interested in wireless scheduling algorithms for the downlink of a single cell that can minimize the queue-overflow probability. Specifically, in a...
V. J. Venkataramanan, Xiaojun Lin
EDBT
2006
ACM
266views Database» more  EDBT 2006»
14 years 11 months ago
From Analysis to Interactive Exploration: Building Visual Hierarchies from OLAP Cubes
We present a novel framework for comprehensive exploration of OLAP data by means of user-defined dynamic hierarchical visualizations. The multidimensional data model behind the OLA...
Svetlana Vinnik, Florian Mansmann
ATAL
2010
Springer
13 years 12 months ago
An architecture for modular distributed simulation with agent-based models
Agent-based simulations are an increasingly popular means of exploring and understanding complex social systems. In order to be useful, these simulations must capture a range of a...
David Scerri, Alexis Drogoul, Sarah L. Hickmott, L...
IACR
2011
162views more  IACR 2011»
12 years 10 months ago
The Parazoa Family: Generalizing the Sponge Hash Functions
Abstract. Sponge functions were introduced by Bertoni et al. as an alternative to the classical MerkleDamg˚ard design. Many hash function submissions to the SHA-3 competition laun...
Elena Andreeva, Bart Mennink, Bart Preneel