Sciweavers

4075 search results - page 425 / 815
» Modeling Distributed Algorithm Using B
Sort
View
ICML
2006
IEEE
16 years 7 months ago
A new approach to data driven clustering
We consider the problem of clustering in its most basic form where only a local metric on the data space is given. No parametric statistical model is assumed, and the number of cl...
Arik Azran, Zoubin Ghahramani
VMV
2003
145views Visualization» more  VMV 2003»
15 years 8 months ago
Interactive Volume Visualization of Complex Flow Semantics
Comprehending results from 3D CFD simulation is a difficult task. In this paper, we present a semantics-based approach to featurebased volume rendering of 3D flow data. We make ...
Helwig Hauser, Matej Mlejnek
TPHOL
2007
IEEE
16 years 1 months ago
Verifying Nonlinear Real Formulas Via Sums of Squares
Techniques based on sums of squares appear promising as a general approach to the universal theory of reals with addition and multiplication, i.e. verifying Boolean combinations of...
John Harrison
CEC
2011
IEEE
14 years 6 months ago
Stochastic Natural Gradient Descent by estimation of empirical covariances
—Stochastic relaxation aims at finding the minimum of a fitness function by identifying a proper sequence of distributions, in a given model, that minimize the expected value o...
Luigi Malagò, Matteo Matteucci, Giovanni Pi...
SODA
2001
ACM
79views Algorithms» more  SODA 2001»
15 years 8 months ago
Learning Markov networks: maximum bounded tree-width graphs
Markov networks are a common class of graphical models used in machine learning. Such models use an undirected graph to capture dependency information among random variables in a ...
David R. Karger, Nathan Srebro