Sciweavers

301 search results - page 12 / 61
» Narrowing Directed by a Graph of Terms
Sort
View
WWW
2009
ACM
14 years 8 months ago
Query clustering using click-through graph
In this paper we describe a problem of discovering query clusters from a click-through graph of web search logs. The graph consists of a set of web search queries, a set of pages ...
Jeonghee Yi, Farzin Maghoul
JCDL
2010
ACM
148views Education» more  JCDL 2010»
13 years 12 months ago
Citing for high impact
The question of citation behavior has always intrigued scientists from various disciplines. While general citation patterns have been widely studied in the literature we develop t...
Xiaolin Shi, Jure Leskovec, Daniel A. McFarland
SODA
2000
ACM
114views Algorithms» more  SODA 2000»
13 years 8 months ago
Typical random 3-SAT formulae and the satisfiability threshold
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...
Olivier Dubois, Yacine Boufkhad, Jacques Mandler
FAC
2002
66views more  FAC 2002»
13 years 7 months ago
Shallow Linear Action Graphs and their Embeddings
Action calculi, which generalise process calculi such as Petri nets, -calculus and ambient calculus, have been presented in terms of action graphs. We here offer linear action grap...
James J. Leifer, Robin Milner
KDD
2007
ACM
144views Data Mining» more  KDD 2007»
14 years 8 months ago
Fast direction-aware proximity for graph mining
In this paper we study asymmetric proximity measures on directed graphs, which quantify the relationships between two nodes or two groups of nodes. The measures are useful in seve...
Hanghang Tong, Christos Faloutsos, Yehuda Koren