Sciweavers

106 search results - page 13 / 22
» Probabilistically Checkable Arguments
Sort
View
PRICAI
2004
Springer
14 years 1 months ago
Text Classification Using Belief Augmented Frames
: In this paper we present our work on applying Belief Augmented Frames to the text classification problem. We formulate the problem in two alternative ways, and we evaluate the pe...
Colin Keng-Yan Tan
CORR
2010
Springer
130views Education» more  CORR 2010»
13 years 8 months ago
Asymptotic Sum-Capacity of Random Gaussian Interference Networks Using Interference Alignment
We consider a dense n-user Gaussian interference network formed by paired transmitters and receivers placed independently at random in Euclidean space. Under natural conditions on ...
Matthew Aldridge, Oliver Johnson, Robert J. Piecho...
DM
2010
89views more  DM 2010»
13 years 8 months ago
Large induced subgraphs with equated maximum degree
For a graph G, denote by fk(G) the smallest number of vertices that must be deleted from G so that the remaining induced subgraph has its maximum degree shared by at least k verti...
Yair Caro, Raphael Yuster
STOC
2001
ACM
161views Algorithms» more  STOC 2001»
14 years 8 months ago
Quantitative solution of omega-regular games
We consider two-player games played for an infinite number of rounds, with -regular winning conditions. The games may be concurrent, in that the players choose their moves simulta...
Luca de Alfaro, Rupak Majumdar
QEST
2010
IEEE
13 years 6 months ago
Automatic Compositional Reasoning for Probabilistic Model Checking of Hardware Designs
Adaptive techniques like voltage and frequency scaling, process variations and the randomness of input data contribute signi cantly to the statistical aspect of contemporary hardwa...
Jayanand Asok Kumar, Shobha Vasudevan