Sciweavers

1381 search results - page 136 / 277
» Fast Filtered Sampling
Sort
View
ICML
2008
IEEE
16 years 3 months ago
Fast incremental proximity search in large graphs
In this paper we investigate two aspects of ranking problems on large graphs. First, we augment the deterministic pruning algorithm in Sarkar and Moore (2007) with sampling techni...
Purnamrita Sarkar, Andrew W. Moore, Amit Prakash
100
Voted
WWW
2009
ACM
16 years 3 months ago
Fast dynamic reranking in large graphs
In this paper we consider the problem of re-ranking search results by incorporating user feedback. We present a graph theoretic measure for discriminating irrelevant results from ...
Purnamrita Sarkar, Andrew W. Moore
97
Voted
KDD
2005
ACM
103views Data Mining» more  KDD 2005»
16 years 2 months ago
Fast discovery of unexpected patterns in data, relative to a Bayesian network
We consider a model in which background knowledge on a given domain of interest is available in terms of a Bayesian network, in addition to a large database. The mining problem is...
Szymon Jaroszewicz, Tobias Scheffer
ACCV
2006
Springer
15 years 8 months ago
Fast Image Replacement Using Multi-resolution Approach
We developed a system including two modules: the texture analysis module and the texture synthesis module. The analysis module is capable of analyzing an input image and performing...
Chih-Wei Fang, James Jenn-Jier Lien
127
Voted
ISPASS
2005
IEEE
15 years 8 months ago
Fast, Accurate Microarchitecture Simulation Using Statistical Phase Detection
Simulation-based microarchitecture research is often hindered by the slow speed of simulators. In this work, we propose a novel statistical technique to identify highly representa...
Ram Srinivasan, Jeanine Cook, Shaun Cooper