Sciweavers

298 search results - page 47 / 60
» Abstract Models of Transfinite Reductions
Sort
View
ICALP
2007
Springer
15 years 4 months ago
Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity
d Abstract) Paul Beame1, , Matei David2, , Toniann Pitassi2, , and Philipp Woelfel2,† 1 University of Washington 2 University of Toronto Abstract. We solve some fundamental probl...
Paul Beame, Matei David, Toniann Pitassi, Philipp ...
KDD
2005
ACM
118views Data Mining» more  KDD 2005»
15 years 10 months ago
On the use of linear programming for unsupervised text classification
We propose a new algorithm for dimensionality reduction and unsupervised text classification. We use mixture models as underlying process of generating corpus and utilize a novel,...
Mark Sandler
MICCAI
2009
Springer
15 years 5 months ago
Improved Maximum a Posteriori Cortical Segmentation by Iterative Relaxation of Priors
Abstract. Thickness measurements of the cerebral cortex can aid diagnosis and provide valuable information about the temporal evolution of several diseases such as Alzheimer’s, H...
Manuel Jorge Cardoso, Matthew J. Clarkson, Gerard ...
FOCS
2009
IEEE
15 years 4 months ago
Bit Encryption Is Complete
Abstract— Under CPA and CCA1 attacks, a secure bit encryption scheme can be applied bit-by-bit to construct a secure many-bit encryption scheme. The same construction fails, howe...
Steven Myers, Abhi Shelat
ALDT
2009
Springer
142views Algorithms» more  ALDT 2009»
15 years 4 months ago
Finding Best k Policies
Abstract. An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k ...
Peng Dai, Judy Goldsmith