Sciweavers

458 search results - page 19 / 92
» Perfect Skolem sets
Sort
View
KDD
2008
ACM
140views Data Mining» more  KDD 2008»
16 years 8 days ago
Semi-supervised approach to rapid and reliable labeling of large data sets
Supervised classification methods have been shown to be very effective for a large number of applications. They require a training data set whose instances are labeled to indicate...
György J. Simon, Vipin Kumar, Zhi-Li Zhang
DALT
2008
Springer
15 years 1 months ago
Model-Checking Strategic Ability and Knowledge of the Past of Communicating Coalitions
We propose a variant of alternating time temporal logic (ATL) with imperfect information, perfect recall, epistemic modalities for the past and strategies which are required to be ...
Dimitar P. Guelev, Catalin Dima
CORR
2007
Springer
95views Education» more  CORR 2007»
14 years 12 months ago
Rateless Coding for Gaussian Channels
— A rateless code—i.e., a rate-compatible family of codes—has the property that codewords of the higher rate codes are prefixes of those of the lower rate ones. A perfect fa...
Uri Erez, Mitchell D. Trott, Gregory W. Wornell
AAAI
2006
15 years 1 months ago
Algorithms for Rationalizability and CURB Sets
Significant work has been done on computational aspects of solving games under various solution concepts, such as Nash equilibrium, subgame perfect Nash equilibrium, correlated eq...
Michael Benisch, George B. Davis, Tuomas Sandholm
ISCA
1998
IEEE
107views Hardware» more  ISCA 1998»
15 years 4 months ago
Memory Dependence Prediction Using Store Sets
For maximum performance, an out-of-order processor must issue load instructions as early as possible, while avoiding memory-order violations with prior store instructions that wri...
George Z. Chrysos, Joel S. Emer