740 search results - page 88 / 148 » Lower bounds for Buchsbaum* complexes |
153
click to vote
EMSOFT
2007
Springer
16 years 10 days ago
2007
Springer
Design space exploration of embedded systems typically focuses on classical design goals such as cost, timing, buffer sizes, and power consumption. Robustness criteria, i.e. sensi...
181
click to vote
STOC
2007
ACM
16 years 6 months ago
2007
ACM
In this work, we consider the problems of testing whether a distribution over {0, 1}n is k-wise (resp. ( , k)-wise) independent using samples drawn from that distribution. For the...
132
click to vote
JC
2007
15 years 6 months ago
2007
Let q ≥ 1 be an integer, Sq denote the unit sphere embedded in the Euclidean space Rq+1, and µq be its Lebesgue surface measure. We establish upper and lower bounds for sup fâˆ...
150
click to vote
FOSSACS
2006
Springer
15 years 9 months ago
2006
Springer
We extend the propositional dynamic logic PDL of Fischer and Ladner with a restricted kind of recursive programs using the formalism of visibly pushdown automata (Alur, Madhusudan...
158
click to vote
FOCS
2008
IEEE
15 years 6 months ago
2008
IEEE
Recent years have seen a significant increase in our understanding of high-dimensional nearest neighbor search (NNS) for distances like the 1 and 2 norms. By contrast, our underst...