Sciweavers

216 search results - page 21 / 44
» Covering Problems with Hard Capacities
Sort
View
IJNSEC
2007
161views more  IJNSEC 2007»
13 years 7 months ago
Data Hiding: Current Status and Key Issues
Image steganography is a covert communication method that uses an image as the cover to hide the truth from potential attackers that some secret message hidden in the image is bei...
Nan-I Wu, Min-Shiang Hwang
CIKM
2008
Springer
13 years 9 months ago
Multi-aspect expertise matching for review assignment
Review assignment is a common task that many people such as conference organizers, journal editors, and grant administrators would have to do routinely. As a computational problem...
Maryam Karimzadehgan, ChengXiang Zhai, Geneva G. B...
CORR
2011
Springer
208views Education» more  CORR 2011»
13 years 2 months ago
GRASP and path-relinking for Coalition Structure Generation
In Artificial Intelligence with Coalition Structure Generation (CSG) one refers to those cooperative complex problems that require to find an optimal partition, maximising a soci...
Nicola Di Mauro, Teresa Maria Altomare Basile, Ste...
ML
2008
ACM
13 years 7 months ago
Margin-based first-order rule learning
Abstract We present a new margin-based approach to first-order rule learning. The approach addresses many of the prominent challenges in first-order rule learning, such as the comp...
Ulrich Rückert, Stefan Kramer
APPROX
2008
Springer
142views Algorithms» more  APPROX 2008»
13 years 9 months ago
Approximating Maximum Subgraphs without Short Cycles
We study approximation algorithms, integrality gaps, and hardness of approximation, of two problems related to cycles of "small" length k in a given graph. The instance f...
Guy Kortsarz, Michael Langberg, Zeev Nutov