Sciweavers

1016 search results - page 32 / 204
» Generalized distances between rankings
Sort
View
EDBT
2010
ACM
177views Database» more  EDBT 2010»
14 years 6 months ago
Bridging the gap between intensional and extensional query evaluation in probabilistic databases
There are two broad approaches to query evaluation over probabilistic databases: (1) Intensional Methods proceed by manipulating expressions over symbolic events associated with u...
Abhay Jha, Dan Olteanu, Dan Suciu
CASES
2005
ACM
14 years 1 months ago
A post-compilation register reassignment technique for improving hamming distance code compression
Code compression is a field where compression ratios between compiler-generated code and subsequent compressed code are highly dependent on decisions made at compile time. Most op...
Montserrat Ros, Peter Sutton
MOBICOM
2010
ACM
13 years 11 months ago
Exploiting temporal stability and low-rank structure for localization in mobile networks
Localization is a fundamental operation for many wireless networks. While GPS is widely used for location determination, it is unavailable in many environments either due to its h...
Swati Rallapalli, Lili Qiu, Yin Zhang, Yi-Chao Che...
WWW
2005
ACM
14 years 12 months ago
PageRank as a function of the damping factor
PageRank is defined as the stationary state of a Markov chain. The chain is obtained by perturbing the transition matrix induced by a web graph with a damping factor that spreads...
Paolo Boldi, Massimo Santini, Sebastiano Vigna
MEDES
2009
ACM
14 years 3 months ago
Web page ranking based on fuzzy and learning automata
The main goal of web pages ranking is to find the interrelated pages. In this paper, we introduce an algorithm called FPR-DLA. In the proposed method learning automata is assigned...
Zohreh Anari, Mohammad Reza Meybodi, Babak Anari