Sciweavers

1132 search results - page 100 / 227
» Upper and lower Ramsey bounds in bounded arithmetic
Sort
View
CORR
2010
Springer
82views Education» more  CORR 2010»
15 years 3 months ago
Secret-key Agreement with Channel State Information at the Transmitter
We study the capacity of secret-key agreement over a wiretap channel with state parameters. The transmitter communicates to the legitimate receiver and the eavesdropper over a disc...
Ashish Khisti, Suhas N. Diggavi, Gregory W. Wornel...
ICALP
2011
Springer
14 years 10 months ago
On the Advice Complexity of the k-Server Problem
Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been in...
Hans-Joachim Böckenhauer, Dennis Komm, Rastis...
MST
2002
152views more  MST 2002»
15 years 6 months ago
Average-Case Analysis of Greedy Packet Scheduling
We study the average number of delays suffered by packets routed using greedy (work conserving) scheduling policies. We obtain tight bounds on the worst-case average number of del...
Zvi Lotker, Boaz Patt-Shamir
ICCAD
2006
IEEE
129views Hardware» more  ICCAD 2006»
16 years 3 months ago
Energy budgeting for battery-powered sensors with a known task schedule
Battery-powered wireless sensors are severely constrained by the amount of the available energy. A method for computing the energy budget per sensing task can be a valuable design...
Daler N. Rakhmatov
COST
2009
Springer
95views Multimedia» more  COST 2009»
16 years 1 months ago
A Matching Algorithm Secure against the Wolf Attack in Biometric Authentication Systems
We propose a matching algorithm secure against the wolf attack in one-to-one biometric authentications. Our proposal algorithm first executes a one-to-all comparison using a conve...
Yoshihiro Kojima, Rie Shigetomi, Manabu Inuma, Aki...