Sciweavers

5180 search results - page 843 / 1036
» Concurrency, Time, and Constraints
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
CHI
2009
ACM
16 years 7 months ago
Can I borrow your phone?: understanding concerns when sharing mobile phones
Mobile phones are becoming increasingly personalized in terms of the data they store and the types of services they provide. At the same time, field studies have reported that the...
Amy K. Karlson, A. J. Bernheim Brush, Stuart E. Sc...
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
2008
ACM
140views Data Mining» more  KDD 2008»
16 years 7 months ago
On updates that constrain the features' connections during learning
In many multiclass learning scenarios, the number of classes is relatively large (thousands,...), or the space and time efficiency of the learning system can be crucial. We invest...
Omid Madani, Jian Huang 0002
KDD
2004
ACM
195views Data Mining» more  KDD 2004»
16 years 7 months ago
Improved robustness of signature-based near-replica detection via lexicon randomization
Detection of near duplicate documents is an important problem in many data mining and information filtering applications. When faced with massive quantities of data, traditional d...
Aleksander Kolcz, Abdur Chowdhury, Joshua Alspecto...