1957 search results - page 189 / 392 » Approximate algorithms for neural-Bayesian approaches |
ICMLA
2008
14 years 11 months ago
2008
A method is presented to partition a given set of data entries embedded in Euclidean space by recursively bisecting clusters into smaller ones. The initial set is subdivided into ...
105
click to vote
VMV
2004
14 years 11 months ago
2004
Visualizing iso-surfaces of volumetric data sets is becoming increasingly important for many practical applications. One crucial task in iso-surface ray tracing is to find the cor...
AAAI
1998
14 years 11 months ago
1998
The typical difficulty of various NP-hard problems varies with simple parameters describing their structure. This behavior is largely independent of the search algorithm, but depe...
TVCG
2008
14 years 10 months ago
2008
We present an interactive algorithm to compute sound propagation paths for transmission, specular reflection and edge diffraction in complex scenes. Our formulation uses an adaptiv...
92
Voted
ICTAI
2010
IEEE
14 years 8 months ago
2010
IEEE
The balanced graph partitioning consists in dividing the vertices of an undirected graph into a given number of subsets of approximately equal size, such that the number of edges c...