Sciweavers

15485 search results - page 260 / 3097
» Computing Optimal Subsets
Sort
View

Publication
101views
14 years 10 days ago
On the degree and half-degree principle for symmetric polynomials
In this note we aim to give a new, elementary proof of a statement that was first proved by Timofte (2003) [15]. It says that a symmetric real polynomial F of degree d in n variabl...
Cordian Riener
WWW
2005
ACM
16 years 7 months ago
A uniform approach to accelerated PageRank computation
In this note we consider a simple reformulation of the traditional power iteration algorithm for computing the stationary distribution of a Markov chain. Rather than communicate t...
Frank McSherry
CISIS
2008
IEEE
16 years 1 months ago
Adaptive Computational Chemotaxis in Bacterial Foraging Algorithm
Some researchers have illustrated how individual and groups of bacteria forage for nutrients and to model it as a distributed optimization process, which is called the Bacterial F...
Sambarta Dasgupta, Arijit Biswas, Ajith Abraham, S...
COLT
2000
Springer
15 years 11 months ago
The Computational Complexity of Densest Region Detection
We investigate the computational complexity of the task of detecting dense regions of an unknown distribution from un-labeled samples of this distribution. We introduce a formal l...
Shai Ben-David, Nadav Eiron, Hans-Ulrich Simon
EUROPKI
2006
Springer
15 years 10 months ago
Pseudonymous PKI for Ubiquitous Computing
Privacy-aware Public Key Infrastructure (PKI) can maintain user access control and yet protect user privacy, which is envisioned as a promising technique in many emerging applicat...
Ke Zeng