Sciweavers

483 search results - page 24 / 97
» Linear Ranking with Reachability
Sort
View
SIGIR
2011
ACM
12 years 11 months ago
Time-based query performance predictors
Query performance prediction is aimed at predicting the retrieval effectiveness that a query will achieve with respect to a particular ranking model. In this paper, we study quer...
Nattiya Kanhabua, Kjetil Nørvåg
CN
2000
70views more  CN 2000»
13 years 8 months ago
An efficient algorithm to rank Web resources
How to rank Web resources is critical to Web Resource Discovery (Search Engine). This paper not only points out the weakness of current approaches, but also presents in-depth anal...
Dell Zhang, Yisheng Dong
ICML
2010
IEEE
13 years 9 months ago
Robust Subspace Segmentation by Low-Rank Representation
We propose low-rank representation (LRR) to segment data drawn from a union of multiple linear (or affine) subspaces. Given a set of data vectors, LRR seeks the lowestrank represe...
Guangcan Liu, Zhouchen Lin, Yong Yu
SCL
2008
109views more  SCL 2008»
13 years 8 months ago
A note on linear function approximation using random projections
ABSTRACT: Linear function approximations based on random projections are proposed and justified for a class of fixed point and minimization problems. KEY WORDS: random projections,...
Kishor Barman, Vivek S. Borkar
ANLP
2000
101views more  ANLP 2000»
13 years 10 months ago
Advances in domain independent linear text segmentation
This paper describes a method for linear text segmentation which is twice as accurate and over seven times as fast as the state-of-the-art (Reynar, 1998). Inter-sentence similarit...
Freddy Y. Y. Choi