Sciweavers

693 search results - page 118 / 139
» Complexity Analysis of Heuristic CSP Search Algorithms
Sort
View
TALG
2010
158views more  TALG 2010»
13 years 2 months ago
Clustering for metric and nonmetric distance measures
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...
Marcel R. Ackermann, Johannes Blömer, Christi...
CIKM
2008
Springer
13 years 10 months ago
Learning latent semantic relations from clickthrough data for query suggestion
For a given query raised by a specific user, the Query Suggestion technique aims to recommend relevant queries which potentially suit the information needs of that user. Due to th...
Hao Ma, Haixuan Yang, Irwin King, Michael R. Lyu
IEEEPACT
2005
IEEE
14 years 1 months ago
HUNTing the Overlap
Hiding communication latency is an important optimization for parallel programs. Programmers or compilers achieve this by using non-blocking communication primitives and overlappi...
Costin Iancu, Parry Husbands, Paul Hargrove
WWW
2004
ACM
14 years 8 months ago
Updating pagerank with iterative aggregation
We present an algorithm for updating the PageRank vector [1]. Due to the scale of the web, Google only updates its famous PageRank vector on a monthly basis. However, the Web chan...
Amy Nicole Langville, Carl Dean Meyer
CORR
2011
Springer
174views Education» more  CORR 2011»
12 years 11 months ago
Parameter Learning of Logic Programs for Symbolic-Statistical Modeling
We propose a logical/mathematical framework for statistical parameter learning of parameterized logic programs, i.e. de nite clause programs containing probabilistic facts with a ...
Yoshitaka Kameya, Taisuke Sato