Sciweavers

3244 search results - page 304 / 649
» On convex complexity measures
Sort
View
DSN
2011
IEEE
14 years 6 months ago
Modeling time correlation in passive network loss tomography
—We consider the problem of inferring link loss rates using passive measurements. Prior inference approaches are mainly built on the time correlation nature of packet losses. How...
Jin Cao, Aiyou Chen, Patrick P. C. Lee
TAMC
2007
Springer
16 years 24 days ago
Improving the Average Delay of Sorting
In previous work we have introduced an average-case measure for the time complexity of Boolean circuits – that is the delay between feeding the input bits into a circuit and the ...
Andreas Jakoby, Maciej Liskiewicz, Rüdiger Re...
COCO
2006
Springer
118views Algorithms» more  COCO 2006»
15 years 10 months ago
Learning Monotone Decision Trees in Polynomial Time
We give an algorithm that learns any monotone Boolean function f : {-1, 1}n {-1, 1} to any constant accuracy, under the uniform distribution, in time polynomial in n and in the de...
Ryan O'Donnell, Rocco A. Servedio
BMCBI
2010
277views more  BMCBI 2010»
15 years 6 months ago
PCA2GO: a new multivariate statistics based method to identify highly expressed GO-Terms
Background: Several tools have been developed to explore and search Gene Ontology (GO) databases allowing efficient GO enrichment analysis and GO tree visualization. Nevertheless,...
Marc Bruckskotten, Mario Looso, Franz Cemic, Anne ...
BMCBI
2008
138views more  BMCBI 2008»
15 years 6 months ago
Information transfer in signaling pathways: A study using coupled simulated and experimental data
Background: The topology of signaling cascades has been studied in quite some detail. However, how information is processed exactly is still relatively unknown. Since quite divers...
Jürgen Pahle, Anne K. Green, C. Jane Dixon, U...