1802 search results - page 230 / 361 » Complexity Theory for Operators in Analysis |
152
click to vote
MOBIHOC
2004
ACM
16 years 6 months ago
2004
ACM
APS algorithms use the basic idea of distance vector routing to find positions in an ad hoc network using only a fraction of landmarks, for example GPS enabled nodes. All the node...
304
click to vote
POPL
2003
ACM
16 years 6 months ago
2003
ACM
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
160
click to vote
WWW
2008
ACM
16 years 7 months ago
2008
ACM
An infosuasive web application is mainly intended to be at the same time informative and persuasive, i.e., it aims at supporting knowledge needs and it has also the (declared or n...
182
click to vote
NIPS
1997
15 years 7 months ago
1997
I present an expectation-maximization (EM) algorithm for principal component analysis (PCA). The algorithm allows a few eigenvectors and eigenvalues to be extracted from large col...
198
click to vote
STOC
2012
ACM
13 years 8 months ago
2012
ACM
We give the first time-space tradeoff lower bounds for Resolution proofs that apply to superlinear space. In particular, we show that there are formulas of size N that have Reso...