11395 search results - page 339 / 2279 » Beyond computer science |
359
click to vote
SDM
2011
SIAM
14 years 9 months ago
2011
SIAM
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
234
click to vote
SIGIR
2002
ACM
15 years 6 months ago
2002
ACM
tion Abstract ChengXiang Zhai (Advisor: John Lafferty) Language Technologies Institute School of Computer Science Carnegie Mellon University With the dramatic increase in online in...
161
click to vote
ICALP
2004
Springer
16 years 3 days ago
2004
Springer
Monadic least fixed point logic MLFP is a natural logic whose expressiveness lies between that of first-order logic FO and monadic second-order logic MSO. In this paper we take ...
175
click to vote
KDD
2006
ACM
16 years 7 months ago
2006
ACM
In recent years there has been an increased interest in frequent pattern discovery in large databases of graph structured objects. While the frequent connected subgraph mining pro...
280
click to vote
ITICSE
2005
ACM
16 years 9 days ago
2005
ACM
This paper describes the first version of P (read “P flat”), a collection of Prolog predicates that aims to provide a pedagogical implementation of concepts and algorithms t...