432 search results - page 49 / 87 » Open Problems with Part-Whole Relations |
123
Voted
CORR
2012
Springer
13 years 8 months ago
2012
Springer
We present a new type of monotone submodular functions: multi-peak submodular functions. Roughly speaking, given a family of sets F, we construct a monotone submodular function f ...
118
click to vote
APPROX
2008
Springer
15 years 2 months ago
2008
Springer
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...
104
click to vote
ESA
2007
Springer
15 years 6 months ago
2007
Springer
We review recent progress in the study of arrangements in computational and combinatorial geometry, and discuss several open problems and areas for further research. In this talk I...
114
click to vote
SODA
2010
ACM
15 years 10 months ago
2010
ACM
We investigate the preemptive scheduling of periodic tasks with hard deadlines. We show that, even in the uniprocessor case, no polynomial time algorithm can test the feasibility ...
ACSC
2006
IEEE
15 years 6 months ago
2006
IEEE
Code obfuscation is a relatively new technique of software protection and it works by deterring reverse engineering attempts by malicious users of software. The objective of obfus...