Sciweavers

5115 search results - page 930 / 1023
» On Randomized Lanczos Algorithms
Sort
View
PSSE
2004
Springer
16 years 22 days ago
Developing and Reasoning About Probabilistic Programs in pGCL
“demonic” nondeterminism, representing abstraction from (or ignorance of) which of two program fragments will be executed. By introducing probabilistic nondeterminism into GCL,...
Annabelle McIver, Carroll Morgan
VLDB
2004
ACM
120views Database» more  VLDB 2004»
16 years 21 days ago
Relational link-based ranking
Link analysis methods show that the interconnections between web pages have lots of valuable information. The link analysis methods are, however, inherently oriented towards analy...
Floris Geerts, Heikki Mannila, Evimaria Terzi
203
Voted
ISCAS
2003
IEEE
201views Hardware» more  ISCAS 2003»
16 years 19 days ago
A regularized simultaneous autoregressive model for texture classification
In this paper, we present a new method for texture classification which we call the regularized simultaneous autoregressive method (RSAR). The regularization technique is introduc...
Yao-wei Wang, Yan-fei Wang, Wen Gao, Yong Xue
237
Voted
WSNA
2003
ACM
16 years 18 days ago
Analysis on the redundancy of wireless sensor networks
Wireless sensor networks consist of a large number of tiny sensors that have only limited energy supply. One of the major challenges in constructing such networks is to maintain l...
Yong Gao, Kui Wu, Fulu Li
PODS
2010
ACM
232views Database» more  PODS 2010»
16 years 13 days ago
Optimal sampling from distributed streams
A fundamental problem in data management is to draw a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With large, streamin...
Graham Cormode, S. Muthukrishnan, Ke Yi, Qin Zhang