Sciweavers

1225 search results - page 139 / 245
» The Instance Complexity Conjecture
Sort
View
EUROCRYPT
2011
Springer
14 years 10 months ago
Concurrent Composition in the Bounded Quantum Storage Model
We define the BQS-UC model, a variant of the UC model, that deals with protocols in the bounded quantum storage model. We present a statistically secure commitment protocol in th...
Dominique Unruh
FOSSACS
2012
Springer
14 years 2 months ago
Concurrent Games with Ordered Objectives
We consider concurrent games played on graphs, in which each player has several qualitative (e.g. reachability or B¨uchi) objectives, and a preorder on these objectives (for insta...
Patricia Bouyer, Romain Brenguier, Nicolas Markey,...
ACL
2012
13 years 9 months ago
Polarity Consistency Checking for Sentiment Dictionaries
Polarity classification of words is important for applications such as Opinion Mining and Sentiment Analysis. A number of sentiment word/sense dictionaries have been manually or ...
Eduard C. Dragut, Hong Wang, Clement T. Yu, A. Pra...
ICDE
2007
IEEE
174views Database» more  ICDE 2007»
16 years 1 months ago
Adapting Partitioned Continuous Query Processing in Distributed Systems
Partitioned query processing is an effective method to process continuous queries with large stateful operators in a distributed systems. This method typically partitions input da...
Yali Zhu, Elke A. Rundensteiner
COLT
1993
Springer
15 years 11 months ago
Bounding the Vapnik-Chervonenkis Dimension of Concept Classes Parameterized by Real Numbers
The Vapnik-Chervonenkis (V-C) dimension is an important combinatorial tool in the analysis of learning problems in the PAC framework. For polynomial learnability, we seek upper bou...
Paul W. Goldberg, Mark Jerrum