Sciweavers

3356 search results - page 126 / 672
» Thresholds and Expectation Thresholds
Sort
View
CORR
2008
Springer
110views Education» more  CORR 2008»
13 years 11 months ago
Counting the Faces of Randomly-Projected Hypercubes and Orthants, with Applications
Let A be an n by N real valued random matrix, and HN denote the N-dimensional hypercube. For numerous random matrix ensembles, the expected number of k-dimensional faces of the ran...
David L. Donoho, Jared Tanner
CORR
2010
Springer
136views Education» more  CORR 2010»
13 years 10 months ago
Maximum Bipartite Matching Size And Application to Cuckoo Hashing
Cuckoo hashing with a stash is a robust high-performance hashing scheme that can be used in many real-life applications. It complements cuckoo hashing by adding a small stash stor...
Josef Kanizo, David Hay, Isaac Keslassy
CCGRID
2001
IEEE
14 years 2 months ago
NwsAlarm: A Tool for Accurately Detecting Resource Performance Degradation
End-users of high-performance computing resources have come to expect that consistent levels of performance be delivered to their applications. The advancement of the Computationa...
Chandra Krintz, Richard Wolski
SODA
2001
ACM
166views Algorithms» more  SODA 2001»
14 years 17 days ago
Better approximation algorithms for bin covering
Bin covering takes as input a list of items with sizes in (0 1) and places them into bins of unit demand so as to maximize the number of bins whose demand is satis ed. This is in ...
János Csirik, David S. Johnson, Claire Keny...
IOR
2006
163views more  IOR 2006»
13 years 11 months ago
Adaptive Importance Sampling Technique for Markov Chains Using Stochastic Approximation
For a discrete-time finite-state Markov chain, we develop an adaptive importance sampling scheme to estimate the expected total cost before hitting a set of terminal states. This s...
T. P. I. Ahamed, Vivek S. Borkar, S. Juneja