Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Search
  Browse All Reviews > Mathematics Of Computing (G) > Discrete Mathematics (G.2) > Applications (G.2.3)  
 
Options:
 
  1-3 of 3 Reviews about "Applications (G.2.3)": Date Reviewed
  Fast multidimension multichoice knapsack heuristic for MP-SoC runtime management
Ykman-Couvreur C., Nollet V., Catthoor F., Corporaal H. ACM Transactions on Embedded Computing Systems 10(3): 1-16, 2011.  Type: Article

Knapsack problems are among the most intensely studied problems in combinatorial optimization. In this paper, Ykman-Couvreur et al. present “a new fast and lightweight heuristic for finding near-optimal solutions for [multidi...

Jul 1 2011
   Engineering graph clustering: models and experimental evaluation
Brandes U., Gaertler M., Wagner D. Journal of Experimental Algorithmics 121.1-es, 2007.  Type: Article

Clustering is an issue that affects nearly all computing disciplines, from computer graphics to bioinformatics; it also affects a wide range of fields outside of computing. Trying to identify regions in which data are denser than other...

Sep 27 2007
  Inf-semilattice approach to self-dual morphology
Heijmans H., Keshet (Kresch) R. Journal of Mathematical Imaging and Vision 17(1): 55-80, 2002.  Type: Article

In general, morphological filters are not self-dual; that is, they do not process dark and bright parts of an image in the same way. In order to build self-dual filters, the authors introduce another ordering technique called reference...

Jul 21 2003
 
 
 
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy