Sciweavers

976 search results - page 107 / 196
» Evaluating Adversarial Partitions
Sort
View
IPM
2006
64views more  IPM 2006»
13 years 8 months ago
Text mining without document context
We consider a challenging clustering task: the clustering of muti-word terms without document co-occurrence information in order to form coherent groups of topics. For this task, ...
Eric SanJuan, Fidelia Ibekwe-Sanjuan
JCSS
2008
120views more  JCSS 2008»
13 years 8 months ago
Quantum certificate complexity
Given a Boolean function f, we study two natural generalizations of the certificate complexity C (f): the randomized certificate complexity RC (f) and the quantum certificate comp...
Scott Aaronson
FSE
2007
Springer
115views Cryptology» more  FSE 2007»
14 years 3 months ago
Improving the Security of MACs Via Randomized Message Preprocessing
Abstract. “Hash then encrypt” is an approach to message authentication, where first the message is hashed down using an ε-universal hash function, and then the resulting k-bi...
Yevgeniy Dodis, Krzysztof Pietrzak
CVPR
2007
IEEE
14 years 11 months ago
What makes a good model of natural images?
Many low-level vision algorithms assume a prior probability over images, and there has been great interest in trying to learn this prior from examples. Since images are very non G...
Yair Weiss, William T. Freeman
IPMI
2007
Springer
14 years 9 months ago
Learning Best Features and Deformation Statistics for Hierarchical Registration of MR Brain Images
A fully learning-based framework has been presented for deformable registration of MR brain images. In this framework, the entire brain is first adaptively partitioned into a numbe...
Guorong Wu, Feihu Qi, Dinggang Shen