Sciweavers

1921 search results - page 350 / 385
» : Designing a Scalable Build Process
Sort
View
NIPS
2004
14 years 11 months ago
Hierarchical Eigensolver for Transition Matrices in Spectral Methods
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...
Chakra Chennubhotla, Allan D. Jepson
NRHM
2000
149views more  NRHM 2000»
14 years 9 months ago
Navigable history: a reader's view of writer's time
Collecting, analyzing, and sharing information via a hypertext results in the continuous modification of information content over a long period of time. Such tasks will benefit fr...
Frank M. Shipman III, Hao-wei Hsieh
64
Voted
WWW
2007
ACM
15 years 10 months ago
Combining classifiers to identify online databases
We address the problem of identifying the domain of online databases. More precisely, given a set F of Web forms automatically gathered by a focused crawler and an online database...
Luciano Barbosa, Juliana Freire
77
Voted
WWW
2005
ACM
15 years 10 months ago
A personalized search engine based on web-snippet hierarchical clustering
In this paper we propose a hierarchical clustering engine, called SnakeT, that is able to organize on-the-fly the search results drawn from 16 commodity search engines into a hier...
Paolo Ferragina, Antonio Gulli
76
Voted
KDD
2009
ACM
152views Data Mining» more  KDD 2009»
15 years 10 months ago
TANGENT: a novel, 'Surprise me', recommendation algorithm
Most of recommender systems try to find items that are most relevant to the older choices of a given user. Here we focus on the "surprise me" query: A user may be bored ...
Kensuke Onuma, Hanghang Tong, Christos Faloutsos