Sciweavers

DCG
2008
104views more  DCG 2008»
13 years 4 months ago
Finding the Homology of Submanifolds with High Confidence from Random Samples
Recently there has been a lot of interest in geometrically motivated approaches to data analysis in high dimensional spaces. We consider the case where data is drawn from sampling...
Partha Niyogi, Stephen Smale, Shmuel Weinberger
CORR
2010
Springer
149views Education» more  CORR 2010»
13 years 4 months ago
A probabilistic and RIPless theory of compressed sensing
This paper introduces a simple and very general theory of compressive sensing. In this theory, the sensing mechanism simply selects sensing vectors independently at random from a ...
Emmanuel J. Candès, Yaniv Plan
CORR
2008
Springer
108views Education» more  CORR 2008»
13 years 4 months ago
Tight Bounds for Blind Search on the Integers
We analyze a simple random process in which a token is moved in the interval A = {0, . . . , n}: Fix a probability distribution
Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wege...
COMBINATORICA
2008
130views more  COMBINATORICA 2008»
13 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
BIOSYSTEMS
2007
72views more  BIOSYSTEMS 2007»
13 years 4 months ago
Parameter-free testing of the shape of a probability distribution
The Kolmogorov–Smirnov test determines the consistency of empirical data with a particular probability distribution. Often, parameters in the distribution are unknown, and have ...
M. Broom, P. Nouvellet, J. P. Bacon, D. Waxman
AMC
2008
78views more  AMC 2008»
13 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
ICASSP
2010
IEEE
13 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
AAAI
2010
13 years 4 months ago
Inducing Probability Distributions from Knowledge Bases with (In)dependence Relations
When merging belief sets from different agents, the result is normally a consistent belief set in which the inconsistency between the original sources is not represented. As proba...
Jianbing Ma, Weiru Liu, Anthony Hunter
IJCAI
1997
13 years 5 months ago
A Symmetric View of Utilities and Probabilities
Motivated by the need to reason about utilities, and inspired by the success of bayesian networks in representing and reasoning about probabilities, we introduce the notion of uti...
Yoav Shoham
UAI
2004
13 years 5 months ago
Monotonicity in Bayesian Networks
For many real-life Bayesian networks, common knowledge dictates that the output established for the main variable of interest increases with higher values for the observable varia...
Linda C. van der Gaag, Hans L. Bodlaender, A. J. F...