Sciweavers

2080 search results - page 40 / 416
» Measuring empirical computational complexity
Sort
View
TCS
2010
13 years 4 months ago
Information measures for infinite sequences
We revisit the notion of computational depth and sophistication for infinite sequences and study the density of the sets of deep and sophisticated infinite sequences. Koppel defin...
Luis Filipe Coelho Antunes, Andre Souto
CCA
2009
Springer
14 years 2 months ago
From Interval Computations to Constraint-Related Set Computations: Towards Faster Estimation of Statistics and ODEs under Interv
Interval computations estimate the uncertainty of the result of data processing in situations in which we only know the upper bounds ∆ on the measurement errors. In this case, ba...
Vladik Kreinovich
METRICS
2003
IEEE
14 years 3 months ago
Definition and Validation of Design Metrics for Distributed Applications
As distributed technologies become more widely used, the need for assessing the quality of distributed applications correspondingly increases. Despite the rich body of research an...
Pablo Rossi, George Fernandez
CVPR
2012
IEEE
12 years 9 days ago
Complex loss optimization via dual decomposition
We describe a novel max-margin parameter learning approach for structured prediction problems under certain non-decomposable performance measures. Structured prediction is a commo...
Mani Ranjbar, Arash Vahdat, Greg Mori
BMCBI
2006
98views more  BMCBI 2006»
13 years 10 months ago
JLIN: A java based linkage disequilibrium plotter
Background: A great deal of effort and expense are being expended internationally in attempts to detect genetic polymorphisms contributing to susceptibility to complex human disea...
Kim W. Carter, Pamela A. McCaskie, Lyle J. Palmer