3415 search results - page 178 / 683 » Lower Bounds for Kernelizations |
148
click to vote
ICDE
2006
IEEE
15 years 10 months ago
2006
IEEE
Semantic validation of the effectiveness of a schema matching system is traditionally performed by comparing system-generated mappings with those of human evaluators. The human ef...
108
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
This paper presents new lower and upper bounds for the optimal compression of binary prefix codes in terms of the most probable input symbol, where compression efficiency is determ...
122
click to vote
ICC
2007
IEEE
15 years 11 months ago
2007
IEEE
In this paper we investigate the fault diagnosis problem in IP networks. We provide a lower bound on the average number of probes per edge using variational inference technique pro...
154
click to vote
ICALP
2004
Springer
15 years 10 months ago
2004
Springer
We consider the following scheduling problem. The input is a set of jobs with equal processing times, where each job is specified by its release time and deadline. The goal is to ...
134
click to vote
PKC
2010
Springer
15 years 8 months ago
2010
Springer
A fundamental privacy problem in the client-server setting is the retrieval of a record from a database maintained by a server so that the computationally bounded server remains ob...