325 search results - page 53 / 65 » Proofs of Restricted Shuffles |
112
click to vote
SIGPRO
2010
14 years 10 months ago
2010
This short note studies a variation of the Compressed Sensing paradigm introduced recently by Vaswani et al., i.e. the recovery of sparse signals from a certain number of linear m...
TALG
2010
14 years 10 months ago
2010
We establish the first nontrivial lower bounds on timespace tradeoffs for the selection problem. We prove that any comparison-based randomized algorithm for finding the median ...
COMPSEC
2010
14 years 10 months ago
2010
In this paper we address the problem of reducing the role mining complexity in RBAC systems. To this aim, we propose a three steps methodology: first, we associate a weight to rol...
115
click to vote
I3E
2009
14 years 9 months ago
2009
Use of web services also on mobile devices becomes increasingly relevant. However, realizing such mobile web services based on the standard protocol stack is often inappropriate f...
114
click to vote
ALGORITHMICA
2011
14 years 6 months ago
2011
We show that computing the crossing number and the odd crossing number of a graph with a given rotation system is NP-complete. As a consequence we can show that many of the well-k...