Sciweavers

2714 search results - page 83 / 543
» Approximation Schemes for Scheduling
Sort
View
92
Voted
APPROX
2004
Springer
121views Algorithms» more  APPROX 2004»
15 years 6 months ago
Small Pseudo-random Families of Matrices: Derandomizing Approximate Quantum Encryption
A quantum encryption scheme (also called private quantum channel, or state randomization protocol) is a one-time pad for quantum messages. If two parties share a classical random s...
Andris Ambainis, Adam Smith
109
Voted
INFOCOM
2009
IEEE
15 years 7 months ago
Minimum-Latency Beaconing Schedule in Multihop Wireless Networks
— Minimum-latency beaconing schedule (MLBS) in synchronous multihop wireless networks seeks a schedule for beaconing with the shortest latency. This problem is NP-hard even when ...
Peng-Jun Wan, Xiao-Hua Xu, Lixin Wang, Xiaohua Jia...
104
Voted
DATE
2007
IEEE
95views Hardware» more  DATE 2007»
15 years 7 months ago
Memory bank aware dynamic loop scheduling
In a parallel system with multiple CPUs, one of the key problems is to assign loop iterations to processors. This problem, known as the loop scheduling problem, has been studied i...
Mahmut T. Kandemir, Taylan Yemliha, Seung Woo Son,...
CGF
1998
86views more  CGF 1998»
15 years 8 days ago
Subdivision Schemes for Thin Plate Splines
Thin plate splines are a well known entity of geometric design. They are defined as the minimizer of a variational problem whose differential operators approximate a simple notio...
Henrik Weimer, Joe D. Warren
ICC
2007
IEEE
15 years 7 months ago
Robust Multibeam Opportunistic Schemes Under Quality of Service Constraints
— Scheduling in a Broadcast (BC) channel based on partial Channel State Information at the Transmitter (CSIT) is carried out in an opportunistic way, where several orthogonal bea...
Nizar Zorba, Ana I. Pérez-Neira