Sciweavers

135 search results - page 19 / 27
» Bounded Vector Signatures and their Applications
Sort
View
PAMI
2007
122views more  PAMI 2007»
13 years 7 months ago
Analyzing Image Structure by Multidimensional Frequency Modulation
—We develop a mathematical framework for quantifying and understanding multidimensional frequency modulations in digital images. We begin with the widely accepted definition of t...
Marios S. Pattichis, Alan C. Bovik
IJBRA
2010
116views more  IJBRA 2010»
13 years 6 months ago
Scaling alignment of large ontologies
: In recent years, the number of ontologies shared on the Web has increased dramatically, supporting a growing set of applications such as biological knowledge sharing, enhanced se...
Suzette Stoutenburg, Jugal Kalita, Kaily Ewing, Li...
PKDD
2010
Springer
164views Data Mining» more  PKDD 2010»
13 years 5 months ago
Efficient Planning in Large POMDPs through Policy Graph Based Factorized Approximations
Partially observable Markov decision processes (POMDPs) are widely used for planning under uncertainty. In many applications, the huge size of the POMDP state space makes straightf...
Joni Pajarinen, Jaakko Peltonen, Ari Hottinen, Mik...
JMLR
2012
11 years 10 months ago
Max-Margin Min-Entropy Models
We propose a new family of latent variable models called max-margin min-entropy (m3e) models, which define a distribution over the output and the hidden variables conditioned on ...
Kevin Miller, M. Pawan Kumar, Benjamin Packer, Dan...
TIT
1998
90views more  TIT 1998»
13 years 7 months ago
On the Complexity of Decoding Lattices Using the Korkin-Zolotarev Reduced Basis
—Upper and lower bounds are derived for the decoding complexity of a general lattice L. The bounds are in terms of the dimension n and the coding gain of L, and are obtained ba...
Amir H. Banihashemi, Amir K. Khandani