9730 search results - page 444 / 1946 » Relating models of backtracking |
184
click to vote
CSCW
2012
ACM
14 years 2 months ago
2012
ACM
We have friends we consider very close and acquaintances we barely know. The social sciences use the term tie strength to denote this differential closeness with the people in our...
192
click to vote
DLOG
2003
15 years 8 months ago
2003
The purpose of the chapter is to help someone familiar with DLs to understand the issues involved in developing an ontology for some universe of discourse, which is to become a co...
219
click to vote
SDM
2012
SIAM
13 years 9 months ago
2012
SIAM
To reveal information hiding in link space of bibliographical networks, link analysis has been studied from different perspectives in recent years. In this paper, we address a no...
210
click to vote
ICFP
2012
ACM
13 years 9 months ago
2012
ACM
The higher-order logic found in proof assistants such as Coq and various HOL systems provides a convenient setting for the development and verification of pure functional program...
216
click to vote
EDBT
2012
ACM
13 years 9 months ago
2012
ACM
In this paper, we study how to find maximal k-edge-connected subgraphs from a large graph. k-edge-connected subgraphs can be used to capture closely related vertices, and findin...