3281 search results - page 620 / 657 » Bases for parametrized iterativity |
WWW
2008
ACM
16 years 15 days ago
2008
ACM
A large body of work has been devoted to identifying community structure in networks. A community is often though of as a set of nodes that has more connections between its member...
WWW
2006
ACM
16 years 15 days ago
2006
ACM
Contextual search refers to proactively capturing the information need of a user by automatically augmenting the user query with information extracted from the search context; for...
190
click to vote
ICFP
2009
ACM
16 years 14 days ago
2009
ACM
We present a new approach for constructing and verifying higherorder, imperative programs using the Coq proof assistant. We build on the past work on the Ynot system, which is bas...
199
click to vote
POPL
2009
ACM
16 years 14 days ago
2009
ACM
This paper describes an inter-procedural technique for computing symbolic bounds on the number of statements a procedure executes in terms of its scalar inputs and user-defined qu...
119
click to vote
KDD
2008
ACM
16 years 7 days ago
2008
ACM
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...