526 search results - page 41 / 106 » Generalized benchmark generation for dynamic combinatorial p... |
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We consider the problem of generating all ideals of a poset. It is a long standing open problem, whether or not the ideals of any poset can be generated in constant amortized time...
199
click to vote
PLDI
2009
ACM
15 years 10 months ago
2009
ACM
Inefficient use of memory, including leaks and bloat, remain a significant challenge for C and C++ developers. Applications with these problems become slower over time as their wo...
112
Voted
CASES
2007
ACM
14 years 11 months ago
2007
ACM
Aggressive compiler optimizations such as software pipelining and loop invariant code motion can significantly improve application performance, but these transformations often re...
SASN
2006
ACM
15 years 3 months ago
2006
ACM
Key predistribution in wireless sensor networks refers to the problem of distributing secret keys among sensors prior to deployment. Solutions appeared in the literature can be cl...
124
click to vote
FOCS
2000
IEEE
15 years 2 months ago
2000
IEEE
In this article, we show several results obtained by combining the use of stable distributions with pseudorandom generators for bounded space. In particular: —We show that, for a...