Sciweavers

3708 search results - page 169 / 742
» Approximating Betweenness Centrality
Sort
View
SIGIR
2010
ACM
15 years 5 months ago
Estimating interference in the QPRP for subtopic retrieval
The Quantum Probability Ranking Principle (QPRP) has been recently proposed, and accounts for interdependent document relevance when ranking. However, to be instantiated, the QPRP...
Guido Zuccon, Leif Azzopardi, Claudia Hauff, Keith...
ICASSP
2010
IEEE
15 years 5 months ago
A non-iterative estimator for the concentration parameter of the relative phase distribution
In this paper, we propose an approximation of the relative phase probability function (RP pdf) and use it to find a non-iterative estimator for the concentration parameter of the...
Yothin Rakvongthai, Soontorn Oraintara
TNN
2008
119views more  TNN 2008»
15 years 5 months ago
Selecting Useful Groups of Features in a Connectionist Framework
Abstract--Suppose for a given classification or function approximation (FA) problem data are collected using sensors. From the output of the th sensor, features are extracted, ther...
Debrup Chakraborty, Nikhil R. Pal
ALGORITHMICA
2004
84views more  ALGORITHMICA 2004»
15 years 5 months ago
Computing Diameter in the Streaming and Sliding-Window Models
We investigate the diameter problem in the streaming and slidingwindow models. We show that, for a stream of n points or a sliding window of size n, any exact algorithm for diamet...
Joan Feigenbaum, Sampath Kannan, Jian Zhang 0004
SODA
2010
ACM
181views Algorithms» more  SODA 2010»
15 years 3 months ago
Near-Optimal Sublinear Time Algorithms for Ulam Distance
We give near-tight bounds for estimating the edit distance between two non-repetitive strings (Ulam distance) with constant approximation, in sub-linear time. For two strings of l...
Alexandr Andoni, Huy L. Nguyen