Sciweavers

10447 search results - page 1745 / 2090
» The Philosophy of Computer Science
Sort
View
WWW
2006
ACM
16 years 7 months ago
Communities from seed sets
Expanding a seed set into a larger community is a common procedure in link-based analysis. We show how to adapt recent results from theoretical computer science to expand a seed s...
Reid Andersen, Kevin J. Lang
WWW
2006
ACM
16 years 7 months ago
Probabilistic models for discovering e-communities
The increasing amount of communication between individuals in e-formats (e.g. email, Instant messaging and the Web) has motivated computational research in social network analysis...
Ding Zhou, Eren Manavoglu, Jia Li, C. Lee Giles, H...
KDD
2006
ACM
208views Data Mining» more  KDD 2006»
16 years 7 months ago
Frequent subgraph mining in outerplanar graphs
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...
Tamás Horváth, Jan Ramon, Stefan Wro...
POPL
2004
ACM
16 years 7 months ago
Asynchronous and deterministic objects
We present in this article a precise security model for data confidentiality in the framework of asynchronous and deterministic objects. Our underlying programming model is based ...
Denis Caromel, Ludovic Henrio, Bernard P. Serpette
CADE
2007
Springer
16 years 7 months ago
Barendregt's Variable Convention in Rule Inductions
Abstract. Inductive definitions and rule inductions are two fundamental reasoning tools in logic and computer science. When inductive definitions involve binders, then Barendregt&#...
Christian Urban, Stefan Berghofer, Michael Norrish
« Prev « First page 1745 / 2090 Last » Next »