Sciweavers

3875 search results - page 408 / 775
» Approximation algorithms for the 0-extension problem
Sort
View
225
Voted
WIOPT
2010
IEEE
15 years 4 months ago
Optimizing power allocation in interference channels using D.C. programming
Abstract--Power allocation is a promising approach for optimizing the performance of mobile radio systems in interference channels. In the present paper, the non-convex objective f...
Hussein Al-Shatri, Tobias Weber
HVEI
2009
15 years 4 months ago
Improved colour to greyscale via integrability correction
The classical approach to converting colour to greyscale is to code the luminance signal as a grey value image. However, the problem with this approach is that the detail at equil...
Mark S. Drew, David Connah, Graham D. Finlayson, M...
CANS
2011
Springer
292views Cryptology» more  CANS 2011»
14 years 6 months ago
Breaking Fully-Homomorphic-Encryption Challenges
At EUROCRYPT ’10, van Dijk, Gentry, Halevi and Vaikuntanathan presented simple fully-homomorphic encryption (FHE) schemes based on the hardness of approximate integer common div...
Phong Q. Nguyen
SWAT
2010
Springer
302views Algorithms» more  SWAT 2010»
15 years 12 months ago
A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs
We consider the problem of partitioning the set of vertices of a given unit disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and various constant factor a...
Imran A. Pirwani, Mohammad R. Salavatipour
WWW
2007
ACM
16 years 7 months ago
Just the right amount: extracting modules from ontologies
The ability to extract meaningful fragments from an ontology is key for ontology re-use. We propose a definition of a module that guarantees to completely capture the meaning of a...
Bernardo Cuenca Grau, Ian Horrocks, Yevgeny Kazako...