Sciweavers

3136 search results - page 335 / 628
» Comparison of Clique-Listing Algorithms
Sort
View
CSDA
2008
122views more  CSDA 2008»
15 years 6 months ago
Time-adaptive quantile regression
An algorithm for time-adaptive quantile regression is presented. The algorithm is based on the simplex algorithm, and the linear optimization formulation of the quantile regressio...
Jan Kloppenborg Møller, Henrik Aalborg Niel...
MOBICOM
2009
ACM
16 years 1 months ago
Scheduling partition for order optimal capacity in large-scale wireless networks
The capacity scaling property specifies the changes in network throughput when network size increases and serves as an essential performance evaluation metric for large-scale wir...
Yi Xu, Wenye Wang
GECCO
2005
Springer
186views Optimization» more  GECCO 2005»
16 years 6 days ago
Subproblem optimization by gene correlation with singular value decomposition
Several ways of using singular value decomposition (SVD), a linear algebra technique typically used for information retrieval, to decompose problems into subproblems are investiga...
Jacob G. Martin
GECCO
2005
Springer
195views Optimization» more  GECCO 2005»
16 years 6 days ago
Evolving fuzzy decision tree structure that adapts in real-time
A fuzzy logic algorithm has been developed that automatically allocates electronic attack (EA) resources distributed over different platforms in real-time. The controller must be ...
James F. Smith III
MICCAI
2010
Springer
15 years 5 months ago
Incorporating Priors on Expert Performance Parameters for Segmentation Validation and Label Fusion: A Maximum a Posteriori STAPL
Abstract. In order to evaluate the quality of segmentations of an image and assess intra- and inter-expert variability in segmentation performance, an Expectation Maximization (EM)...
Olivier Commowick, Simon K. Warfield