Sciweavers

2080 search results - page 218 / 416
» Measuring empirical computational complexity
Sort
View
TSMC
2008
138views more  TSMC 2008»
15 years 5 months ago
Image Thresholding Using Graph Cuts
A novel thresholding algorithm is presented in this paper to improve image segmentation performance at a low computational cost. The proposed algorithm uses a normalized graphcut m...
Wenbing Tao, Hai Jin, Yimin Zhang, Liman Liu, Desh...
CANDC
2004
ACM
15 years 5 months ago
Cycling in ecological networks: Finn's index revisited
A chief cybernetic feature of natural living systems is the recycling of nutrients, which tends to enhance stability and is one of the principal causes of ecosystem complexity. In...
Stefano Allesina, Robert E. Ulanowicz
CORR
2000
Springer
91views Education» more  CORR 2000»
15 years 4 months ago
Algorithmic Theories of Everything
The probability distribution P from which the history of our universe is sampled represents a theory of everything or TOE. We assume P is formally describable. Since most (uncount...
Jürgen Schmidhuber
TMM
2010
143views Management» more  TMM 2010»
14 years 11 months ago
A Comparison of Perceptually-Based Metrics for Objective Evaluation of Geometry Processing
Recent advances in 3D graphics technologies have led to an increasing use of processing techniques on 3D meshes, such as filtering, compression, watermarking, simplification, defor...
Guillaume Lavoué, Massimiliano Corsini
DSN
2011
IEEE
14 years 4 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