Sciweavers

5785 search results - page 244 / 1157
» Approximability of Probability Distributions
Sort
View
BMVC
1998
15 years 5 months ago
Active Object Recognition in Parametric Eigenspace
We present an efficient method within an active vision framework for recognizing objects which are ambiguous from certain viewpoints. The system is allowed to reposition the camer...
Hermann Borotschnig, Lucas Paletta, Manfred Prantl...
155
Voted
ICASSP
2010
IEEE
15 years 4 months ago
Structuring a gene network using a multiresolution independence test
In order to structure a gene network, a score-based approach is often used. A score-based approach, however, is problematic because by assuming a probability distribution, one is ...
Takayuki Yamamoto, Tetsuya Takiguchi, Yasuo Ariki
AMC
2008
78views more  AMC 2008»
15 years 4 months ago
Information processing in complex networks: Graph entropy and information functionals
This paper introduces a general framework for defining the entropy of a graph. Our definition is based on a local information graph and on information functionals derived from the...
Matthias Dehmer
COMBINATORICA
2008
130views more  COMBINATORICA 2008»
15 years 4 months ago
Two-point concentration in random geometric graphs
A random geometric graph Gn is constructed by taking vertices X1, . . . , Xn Rd at random (i.i.d. according to some probability distribution with a bounded density function) and...
Tobias Müller
CORR
2008
Springer
111views Education» more  CORR 2008»
15 years 3 months ago
Concave Programming Upper Bounds on the Capacity of 2-D Constraints
The capacity of 1-D constraints is given by the entropy of a corresponding stationary maxentropic Markov chain. Namely, the entropy is maximized over a set of probability distribut...
Ido Tal, Ron M. Roth