Sciweavers

980 search results - page 40 / 196
» On Negative Bases
Sort
View
LATINCRYPT
2010
13 years 6 months ago
On the Round Complexity of Zero-Knowledge Proofs Based on One-Way Permutations
We consider the following problem: can we construct constant-round zero-knowledge proofs (with negligible soundness) for NP assuming only the existence of one-way permutations? We...
S. Dov Gordon, Hoeteck Wee, David Xiao, Arkady Yer...
GLOBECOM
2010
IEEE
13 years 5 months ago
Credit-Based Mechanism Protecting Multi-Hop Wireless Networks from Rational and Irrational Packet Drop
The existing credit-based mechanisms mainly focus on stimulating the rational packet droppers to relay other nodes' packets, but they cannot identify the irrational packet dro...
Mohamed Elsalih Mahmoud, Xuemin Shen
KAIS
2008
114views more  KAIS 2008»
13 years 7 months ago
A new concise representation of frequent itemsets using generators and a positive border
A complete set of frequent itemsets can get undesirably large due to redundancy when the minimum support threshold is low or when the database is dense. Several concise representat...
Guimei Liu, Jinyan Li, Limsoon Wong
CSE
2009
IEEE
13 years 11 months ago
Churn Prediction in MMORPGs: A Social Influence Based Approach
Massively Multiplayer Online Role Playing Games (MMORPGs) are computer based games in which players interact with one another in the virtual world. Worldwide revenues for MMORPGs h...
Jaya Kawale, Aditya Pal, Jaideep Srivastava
ECML
2005
Springer
14 years 1 months ago
Learning (k, l)-Contextual Tree Languages for Information Extraction
This paper introduces a novel method for learning a wrapper for extraction of information from web pages, based upon (k,l)-contextual tree languages. It also introduces a method to...
Stefan Raeymaekers, Maurice Bruynooghe, Jan Van de...