Sciweavers

447 search results - page 57 / 90
» Re-ranking search results using document-passage graphs
Sort
View
ATAL
2009
Springer
15 years 4 months ago
Directed soft arc consistency in pseudo trees
We propose an efficient method that applies directed soft arc consistency to a Distributed Constraint Optimization Problem (DCOP) which is a fundamental framework of multi-agent ...
Toshihiro Matsui, Marius-Calin Silaghi, Katsutoshi...
KDD
2004
ACM
190views Data Mining» more  KDD 2004»
15 years 10 months ago
Kernel k-means: spectral clustering and normalized cuts
Kernel k-means and spectral clustering have both been used to identify clusters that are non-linearly separable in input space. Despite significant research, these methods have re...
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
CSCLP
2006
Springer
15 years 1 months ago
Efficient Recognition of Acyclic Clustered Constraint Satisfaction Problems
Abstract. In this paper we present a novel approach to solving Constraint Satisfaction Problems whose constraint graphs are highly clustered and the graph of clusters is close to b...
Igor Razgon, Barry O'Sullivan
VIS
2009
IEEE
215views Visualization» more  VIS 2009»
15 years 11 months ago
Iconizer: A Framework to Identify and Create Effective Representations for Visual Information Encoding
concept form search query vision confirm consensus refine search query graphics VIE-designer image objects image objects Visual Sign (VIE) run search query words images Iconizer:...
Supriya Garg, Tamara Berg, Klaus Mueller
CIKM
2004
Springer
15 years 3 months ago
Local methods for estimating pagerank values
The Google search engine uses a method called PageRank, together with term-based and other ranking techniques, to order search results returned to the user. PageRank uses link ana...
Yen-Yu Chen, Qingqing Gan, Torsten Suel