Sciweavers

1091 search results - page 95 / 219
» On the temporal dimension of search
Sort
View
DAM
2007
94views more  DAM 2007»
15 years 1 months ago
New formulations for the Kissing Number Problem
Determining the maximum number of D-dimensional spheres of radius r that can be adjacent to a central sphere of radius r is known as the Kissing Number Problem (KNP). The problem ...
Sergei Kucherenko, Pietro Belotti, Leo Liberti, Ne...
CDC
2009
IEEE
285views Control Systems» more  CDC 2009»
14 years 11 months ago
Adaptive randomized algorithm for finding eigenvector of stochastic matrix with application to PageRank
Abstract-- The problem of finding the eigenvector corresponding to the largest eigenvalue of a stochastic matrix has numerous applications in ranking search results, multi-agent co...
Alexander V. Nazin, Boris T. Polyak
WSDM
2010
ACM
322views Data Mining» more  WSDM 2010»
15 years 11 months ago
Inferring Search Behaviors Using Partially Observable Markov (POM) Model
This article describes an application of the partially observable Markov (POM) model to the analysis of a large scale commercial web search log. Mathematically, POM is a variant o...
Kuansan Wang, Nikolas Gloy, Xiaolong Li
ICDE
2008
IEEE
117views Database» more  ICDE 2008»
16 years 3 months ago
Similarity Search in Arbitrary Subspaces Under Lp-Norm
Similarity search has been widely used in many applications such as information retrieval, image data analysis, and time-series matching. Specifically, a similarity query retrieves...
Xiang Lian, Lei Chen 0002
CIKM
2007
Springer
15 years 8 months ago
Shine: search heterogeneous interrelated entities
Heterogeneous entities or objects are very common and are usually interrelated with each other in many scenarios. For example, typical Web search activities involve multiple types...
Xuanhui Wang, Jian-Tao Sun, Zheng Chen