Sciweavers

7150 search results - page 431 / 1430
» An Approximation Algorithm for Approximation Rank
Sort
View
JUCS
2008
151views more  JUCS 2008»
15 years 6 months ago
Bloch's Constant is Computable
: We prove the computability of Bloch's constant by presenting the first algorithm approximating the constant up to arbitrary precision. Key Words: computability, algorithm, B...
Robert Rettinger
WWW
2010
ACM
16 years 1 months ago
Empirical comparison of algorithms for network community detection
Detecting clusters or communities in large real-world graphs such as large social or information networks is a problem of considerable interest. In practice, one typically chooses...
Jure Leskovec, Kevin J. Lang, Michael W. Mahoney
183
Voted
PG
1999
IEEE
15 years 11 months ago
Boundary Determination for Trivariate Solids
The trivariate tensor-product B-spline solid is a direct extension of the B-spline patch and has been shown to be useful in the creation and visualization of free-form geometric s...
Kenneth I. Joy, Mark A. Duchaineau
DSMML
2004
Springer
15 years 10 months ago
Variational Bayes Estimation of Mixing Coefficients
We investigate theoretically some properties of variational Bayes approximations based on estimating the mixing coefficients of known densities. We show that, with probability 1 a...
Bo Wang 0002, D. M. Titterington
EVOW
2006
Springer
15 years 10 months ago
The Core Concept for the Multidimensional Knapsack Problem
Abstract. We present the newly developed core concept for the Multidimensional Knapsack Problem (MKP) which is an extension of the classical concept for the one-dimensional case. T...
Jakob Puchinger, Günther R. Raidl, Ulrich Pfe...