Sciweavers

3415 search results - page 338 / 683
» Lower bounds on kernelization
Sort
View
COR
2011
15 years 1 months ago
Online scheduling of weighted equal-length jobs with hard deadlines on parallel machines
We consider the problem of scheduling a maximum profit selection of equal length jobs on m identical machines. Jobs arrive online over time and the goal is to determine a non-pre...
Sven Oliver Krumke, Alfred Taudes, Stephan Westpha...
CISS
2010
IEEE
14 years 10 months ago
On Gaussian MIMO compound wiretap channels
— We study the two-user one-eavesdropper discrete memoryless compound wiretap channel, where the transmitter sends a common confidential message to both users, which needs to be...
Ersen Ekrem, Sennur Ulukus
INFOCOM
2011
IEEE
14 years 10 months ago
Approximate distance queries and compact routing in sparse graphs
—An approximate distance query data structure is a compact representation of a graph, and can be queried to approximate shortest paths between any pair of vertices. Any such data...
Rachit Agarwal, Philip Brighten Godfrey, Sariel Ha...
ICCV
2011
IEEE
14 years 6 months ago
Multiplexed Illumination for Scene Recovery in the Presence of Global Illumination
Global illumination effects such as inter-reflections and subsurface scattering result in systematic, and often significant errors in scene recovery using active illumination. R...
Jinwei Gu, Toshihiro Kabayashi, Mohit Gupta, Shree...
CRYPTO
2011
Springer
232views Cryptology» more  CRYPTO 2011»
14 years 6 months ago
Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups
Structure-preserving signatures are signatures defined over bilinear groups that rely on generic group operations. In particular, the messages and signatures consist of group elem...
Masayuki Abe, Jens Groth, Kristiyan Haralambiev, M...