Sciweavers

30 search results - page 5 / 6
» Two Techniques for Minimizing Resolution Proofs
Sort
View
COCO
2004
Springer
118views Algorithms» more  COCO 2004»
14 years 4 months ago
Towards the Classical Communication Complexity of Entanglement Distillation Protocols with Incomplete Information
Entanglement is an essential resource for quantum communication and quantum computation, similar to shared random bits in the classical world. Entanglement distillation extracts n...
Andris Ambainis, Ke Yang
CVPR
2011
IEEE
13 years 7 months ago
Importance Filtering for Image Retargeting
Content-aware image retargeting has attracted a lot of interests recently. The key and most challenging issue for this task is how to balance the tradeoff between preserving the i...
Yuanyuan Ding, Jing Xiao
INFOCOM
2003
IEEE
14 years 4 months ago
S-MIP: A Seamless Handoff Architecture for Mobile IP
—As the number of Mobile IP (MIP) [2] users grow, so will the demand for delay sensitive real-time applications, such as audio streaming, that require seamless handoff, namely, a...
Robert Hsieh, Zhe Guang Zhou, Aruna Seneviratne
ICONIP
2008
14 years 10 days ago
On Weight-Noise-Injection Training
Abstract. While injecting weight noise during training has been proposed for more than a decade to improve the convergence, generalization and fault tolerance of a neural network, ...
Kevin Ho, Chi-Sing Leung, John Sum
IPCO
1998
99views Optimization» more  IPCO 1998»
14 years 7 days ago
Non-approximability Results for Scheduling Problems with Minsum Criteria
We provide several non-approximability results for deterministic scheduling problems whose objective is to minimize the total job completion time. Unless P = NP, none of the probl...
Han Hoogeveen, Petra Schuurman, Gerhard J. Woeging...