Sciweavers

3415 search results - page 185 / 683
» Lower bounds on kernelization
Sort
View
ICALP
2007
Springer
15 years 11 months ago
Mechanism Design for Fractional Scheduling on Unrelated Machines
In this paper, we consider the mechanism design version of the fractional variant of the scheduling problem on unrelated machines. We give a lower bound of 2 − 1/n for any fracti...
George Christodoulou, Elias Koutsoupias, Annam&aac...
ICPR
2010
IEEE
15 years 10 months ago
Constrained Energy Minimization for Matching-Based Image Recognition
We propose to use energy minimization in MRFs for matching-based image recognition tasks. To this end, the Tree-Reweighted Message Passing algorithm is modified by geometric cons...
Tobias Gass, Philippe Dreuw, Hermann Ney
CDC
2009
IEEE
111views Control Systems» more  CDC 2009»
15 years 10 months ago
Restricted real perturbation values with applications to the structured real controllability radius of LTI systems
Abstract— In this paper, the concept of restricted real perturbation values of a complex matrix triplet is introduced, and a formula for computing lower bounds of these values is...
Simon Lam, Edward J. Davison
123
Voted
GLVLSI
2000
IEEE
116views VLSI» more  GLVLSI 2000»
15 years 9 months ago
Reducing bus transition activity by limited weight coding with codeword slimming
Transitions on high capacitance busses in VLSI systems result in considerable power dissipation. Various coding schemes have been proposed in literature to encode the input signal...
Vijay Sundararajan, Keshab K. Parhi
CRYPTO
1992
Springer
168views Cryptology» more  CRYPTO 1992»
15 years 9 months ago
Threshold Schemes with Disenrollment
Blakley, Blakley, Chan and Massey conjectured a lower bound on the entropy of broadcast messages in threshold schemes with disenrollment. In an effort to examine the conjecture, w...
Bob Blakley, G. R. Blakley, Agnes Hui Chan, James ...