Sciweavers

5055 search results - page 622 / 1011
» Relative Timing
Sort
View
ICLP
2009
Springer
16 years 7 months ago
Computing Loops with at Most One External Support Rule for Disjunctive Logic Programs
We extend to disjunctive logic programs our previous work on computing loop formulas of loops with at most one external support. We show that for these logic programs, loop formula...
Xiaoping Chen, Jianmin Ji, Fangzhen Lin
EUROCRYPT
2009
Springer
16 years 7 months ago
Key Agreement from Close Secrets over Unsecured Channels
We consider information-theoretic key agreement between two parties sharing somewhat different versions of a secret w that has relatively little entropy. Such key agreement, also ...
Bhavana Kanukurthi, Leonid Reyzin
KDD
2006
ACM
198views Data Mining» more  KDD 2006»
16 years 7 months ago
Estimating the global pagerank of web communities
Localized search engines are small-scale systems that index a particular community on the web. They offer several benefits over their large-scale counterparts in that they are rel...
Jason V. Davis, Inderjit S. Dhillon
KDD
2006
ACM
175views Data Mining» more  KDD 2006»
16 years 7 months ago
A mixture model for contextual text mining
Contextual text mining is concerned with extracting topical themes from a text collection with context information (e.g., time and location) and comparing/analyzing the variations...
Qiaozhu Mei, ChengXiang Zhai
KDD
2006
ACM
157views Data Mining» more  KDD 2006»
16 years 7 months ago
Using structure indices for efficient approximation of network properties
Statistics on networks have become vital to the study of relational data drawn from areas such as bibliometrics, fraud detection, bioinformatics, and the Internet. Calculating man...
Matthew J. Rattigan, Marc Maier, David Jensen