Sciweavers

3545 search results - page 460 / 709
» Computational methods for case-cohort studies
Sort
View
GI
2009
Springer
15 years 4 months ago
Coarse graining of an individual-based plant model
: The evolution and structuring of plant communities is governed by local plant-to-plant interaction. It has been shown that the individual variability of the organisms and the spa...
Johannes Hoefener, Lars Rudolf, Uta Berger, Thilo ...
CORR
2010
Springer
159views Education» more  CORR 2010»
15 years 4 months ago
On optimizing over lift-and-project closures
The lift-and-project closure is the relaxation obtained by computing all lift-and-project cuts from the initial formulation of a mixed integer linear program or equivalently by co...
Pierre Bonami
PAMI
2011
15 years 1 months ago
Parallel Spectral Clustering in Distributed Systems
Spectral clustering algorithms have been shown to be more effective in finding clusters than some traditional algorithms such as k-means. However, spectral clustering suffers fro...
Wen-Yen Chen, Yangqiu Song, Hongjie Bai, Chih-Jen ...
JDCTA
2010
163views more  JDCTA 2010»
15 years 1 months ago
Predictive Analysis for Customer Relationship Management
The approach for predictive analysis focuses on a business strategy to streamline business-customer relationships in order to maximize client satisfaction and thereby improve cust...
Manisha Rathi, Anand Priyadarshini, Ankit Rastogi
JGO
2010
100views more  JGO 2010»
15 years 1 months ago
On convex relaxations of quadrilinear terms
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
Sonia Cafieri, Jon Lee, Leo Liberti