Sciweavers

450 search results - page 23 / 90
» Estimating Search Tree Size
Sort
View
WWW
2007
ACM
14 years 9 months ago
Efficient search engine measurements
We address the problem of measuring global quality metrics of search engines, like corpus size, index freshness, and density of duplicates in the corpus. The recently proposed est...
Ziv Bar-Yossef, Maxim Gurevich
AVI
2006
13 years 10 months ago
Navigation in degree of interest trees
We present an experiment that compares how people perform search tasks in a degree-of-interest browser and in a Windows-Explorer-like browser. Our results show that, whereas users...
Raluca Budiu, Peter Pirolli, Michael Fleetwood
KDD
2003
ACM
150views Data Mining» more  KDD 2003»
14 years 9 months ago
Learning relational probability trees
Classification trees are widely used in the machine learning and data mining communities for modeling propositional data. Recent work has extended this basic paradigm to probabili...
Jennifer Neville, David Jensen, Lisa Friedland, Mi...
ACCV
2009
Springer
14 years 3 months ago
Interactive Super-Resolution through Neighbor Embedding
Learning based super-resolution can recover high resolution image with high quality. However, building an interactive learning based super-resolution system for general images is e...
Jian Pu, Junping Zhang, Peihong Guo, Xiaoru Yuan
TSP
2010
13 years 3 months ago
Low-complexity decoding via reduced dimension maximum-likelihood search
In this paper, we consider a low-complexity detection technique referred to as a reduced dimension maximum-likelihood search (RD-MLS). RD-MLS is based on a partitioned search which...
Jun Won Choi, Byonghyo Shim, Andrew C. Singer, Nam...