Sciweavers

423 search results - page 34 / 85
» On Term Rewriting Systems Having a Rational Derivation
Sort
View
CCS
2011
ACM
13 years 9 months ago
Automatically optimizing secure computation
On the one hand, compilers for secure computation protocols, such as FairPlay or FairPlayMP, have significantly simplified the development of such protocols. On the other hand, ...
Florian Kerschbaum
AI
2007
Springer
15 years 3 months ago
Constructing a User Preference Ontology for Anti-spam Mail Systems
The judgment that whether an email is spam or non-spam may vary from person to person. Different individuals can have totally different responses to the same email based on their p...
Jongwan Kim, Dejing Dou, Haishan Liu, Donghwi Kwak
JAIR
2011
144views more  JAIR 2011»
14 years 4 months ago
Iterated Belief Change Due to Actions and Observations
In action domains where agents may have erroneous beliefs, reasoning about the effects of actions involves reasoning about belief change. In this paper, we use a transition system...
Aaron Hunter, James P. Delgrande
ALGORITHMICA
2010
106views more  ALGORITHMICA 2010»
14 years 9 months ago
Analysis of the Expected Number of Bit Comparisons Required by Quickselect
When algorithms for sorting and searching are applied to keys that are represented as bit strings, we can quantify the performance of the algorithms not only in terms of the numbe...
James Allen Fill, Takéhiko Nakama
KDD
2006
ACM
170views Data Mining» more  KDD 2006»
15 years 10 months ago
Classification features for attack detection in collaborative recommender systems
Collaborative recommender systems are highly vulnerable to attack. Attackers can use automated means to inject a large number of biased profiles into such a system, resulting in r...
Robin D. Burke, Bamshad Mobasher, Chad Williams, R...