Sciweavers

3731 search results - page 133 / 747
» cases 2006
Sort
View
IPL
2006
97views more  IPL 2006»
15 years 6 months ago
A tight lower bound for job scheduling with cancellation
The Job Scheduling with Cancellation problem is a variation of classical scheduling problems in which jobs can be cancelled while waiting for execution. In this paper we prove a t...
Feifeng Zheng, Francis Y. L. Chin, Stanley P. Y. F...
IPL
2006
87views more  IPL 2006»
15 years 6 months ago
Fast generators for the Diffie-Hellman key agreement protocol and malicious standards
The Diffie-Hellman key agreement protocol is based on taking large powers of a generator of a prime-order cyclic group. Some generators allow faster exponentiation. We show that to...
Boaz Tsaban
JMLR
2006
87views more  JMLR 2006»
15 years 6 months ago
Second Order Cone Programming Approaches for Handling Missing and Uncertain Data
We propose a novel second order cone programming formulation for designing robust classifiers which can handle uncertainty in observations. Similar formulations are also derived f...
Pannagadatta K. Shivaswamy, Chiranjib Bhattacharyy...
JPDC
2006
134views more  JPDC 2006»
15 years 6 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong
JPDC
2006
106views more  JPDC 2006»
15 years 6 months ago
Computing nearest neighbors in real time
The nearest-neighbor method can successfully be applied to correct possible errors induced into bit strings transmitted over noisy communication channels or to classify samples in...
Marius Nagy, Selim G. Akl