Sciweavers

2354 search results - page 227 / 471
» Randomness, Stochasticity and Approximations
Sort
View
ICCV
2005
IEEE
15 years 11 months ago
A Unifying Approach to Hard and Probabilistic Clustering
We derive the clustering problem from first principles showing that the goal of achieving a probabilistic, or ”hard”, multi class clustering result is equivalent to the algeb...
Ron Zass, Amnon Shashua
IWDW
2005
Springer
15 years 11 months ago
On the Achievable Rate of Side Informed Embedding Techniques with Steganographic Constraints
The development of watermarking schemes in the literature is generally guided by a power constraint on the watermark to be embedded into the host. In a steganographic framework the...
Mark T. Hogan, Félix Balado, Neil J. Hurley...
ESANN
2004
15 years 7 months ago
Convergence properties of a fuzzy ARTMAP network
FAMR (Fuzzy ARTMAP with Relevance factor) is a FAM (Fuzzy ARTMAP) neural network used for classification, probability estimation [3], [2], and function approximation [4]. FAMR uses...
Razvan Andonie, Lucian Sasu
PE
2006
Springer
145views Optimization» more  PE 2006»
15 years 5 months ago
Closed form solutions for mapping general distributions to quasi-minimal PH distributions
Approximating general distributions by phase-type (PH) distributions is a popular technique in stochastic analysis, since the Markovian property of PH distributions often allows a...
Takayuki Osogami, Mor Harchol-Balter
APPROX
2007
Springer
100views Algorithms» more  APPROX 2007»
16 years 3 days ago
Implementing Huge Sparse Random Graphs
Consider a scenario where one desires to simulate the execution of some graph algorithm on random input graphs of huge, perhaps even exponential size. Sampling and storing these h...
Moni Naor, Asaf Nussboim