Sciweavers

380 search results - page 33 / 76
» A Categorical Setting for Lower Complexity
Sort
View
ECCC
2010
87views more  ECCC 2010»
14 years 7 months ago
Testing monotonicity of distributions over general partial orders
We investigate the number of samples required for testing the monotonicity of a distribution with respect to an arbitrary underlying partially ordered set. Our first result is a n...
Arnab Bhattacharyya, Eldar Fischer, Ronitt Rubinfe...
EUROCAST
2005
Springer
102views Hardware» more  EUROCAST 2005»
15 years 3 months ago
Approximation Problems Categories
abstract NP-hard optimization problem, in a general sense. From the observation that, intuitively, there are many connections among categorical concepts and structural complexity n...
Liara Aparecida dos Santos Leal, Dalcidio Moraes C...
ICDM
2005
IEEE
116views Data Mining» more  ICDM 2005»
15 years 3 months ago
Learning Functional Dependency Networks Based on Genetic Programming
Bayesian Network (BN) is a powerful network model, which represents a set of variables in the domain and provides the probabilistic relationships among them. But BN can handle dis...
Wing-Ho Shum, Kwong-Sak Leung, Man Leung Wong
CVPR
2010
IEEE
15 years 5 months ago
Moving Vistas: Exploiting Motion for Describing Scenes
Scene recognition in an unconstrained setting is an open and challenging problem with wide applications. In this paper, we study the role of scene dynamics for improved representa...
Nitesh Shroff, Pavan Turaga, Rama Chellappa
JEI
2006
128views more  JEI 2006»
14 years 9 months ago
Performance study of common image steganography and steganalysis techniques
Abstract. We investigate the performance of state of the art universal steganalyzers proposed in the literature. These universal steganalyzers are tested against a number of well-k...
Mehdi Kharrazi, Husrev T. Sencar, Nasir D. Memon