922 search results - page 125 / 185 » On a Generalization of the Stone-Weierstrass Theorem |
232
click to vote
HT
2011
ACM
14 years 9 months ago
2011
ACM
Personalized search and browsing is increasingly vital especially for enterprises to able to reach their customers. Key challenge in supporting personalization is the need for ric...
186
click to vote
IACR
2011
14 years 5 months ago
2011
We put forth a framework for expressing security requirements from interactive protocols in the presence of arbitrary leakage. This allows capturing different levels of leakage to...
172
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
In 2000 Alber et al. [SWAT 2000 ] obtained the first parameterized subexponential algorithm on undirected planar graphs by showing that k-DOMINATING SET is solvable in time 2O( ...
151
click to vote
BIRTHDAY
2006
Springer
15 years 10 months ago
2006
Springer
Sometimes it is pragmatically useful to prove a theorem by contradiction rather than finding a direct proof. Some reductio ad absurdum arguments have made mathematical history and ...
161
click to vote
JCT
2007
15 years 6 months ago
2007
We define the notions of successive ranks and generalized Durfee squares for overpartitions. We show how these combinatorial statistics give extensions to overpartitions of combin...