Sciweavers

217 search results - page 42 / 44
» Quantifying group problem solving with stochastic analysis
Sort
View
COMPUTER
1999
69views more  COMPUTER 1999»
13 years 7 months ago
Scientific Components Are Coming
abstract mathematical or physical statement, not something specific. The way scientific programmers most frequently verify that their programs are correct is to examine their resul...
Paul F. Dubois
WWW
2008
ACM
14 years 8 months ago
Tag-based social interest discovery
The success and popularity of social network systems, such as del.icio.us, Facebook, MySpace, and YouTube, have generated many interesting and challenging problems to the research...
Xin Li, Lei Guo, Yihong Eric Zhao
CORR
2011
Springer
167views Education» more  CORR 2011»
13 years 2 months ago
Fast global convergence of gradient methods for high-dimensional statistical recovery
Many statistical M-estimators are based on convex optimization problems formed by the weighted sum of a loss function with a norm-based regularizer. We analyze the convergence rat...
Alekh Agarwal, Sahand Negahban, Martin J. Wainwrig...
GECCO
2004
Springer
164views Optimization» more  GECCO 2004»
14 years 1 months ago
Fuzzy Dominance Based Multi-objective GA-Simplex Hybrid Algorithms Applied to Gene Network Models
Hybrid algorithms that combine genetic algorithms with the Nelder-Mead simplex algorithm have been effective in solving certain optimization problems. In this article, we apply a s...
Praveen Koduru, Sanjoy Das, Stephen Welch, Judith ...
STOC
2010
ACM
185views Algorithms» more  STOC 2010»
13 years 11 months ago
Measuring independence of datasets
Approximating pairwise, or k-wise, independence with sublinear memory is of considerable importance in the data stream model. In the streaming model the joint distribution is give...
Vladimir Braverman, Rafail Ostrovsky