Sciweavers

1094 search results - page 197 / 219
» One Size Fits All
Sort
View
ICALP
2005
Springer
14 years 1 months ago
Approximation Algorithms for the Max-coloring Problem
Given a graph G = (V, E) and positive integral vertex weights w : V → N, the max-coloring problem seeks to find a proper vertex coloring of G whose color classes C1, C2, . . . ,...
Sriram V. Pemmaraju, Rajiv Raman
ISW
2005
Springer
14 years 1 months ago
Tracing-by-Linking Group Signatures
In a group signature [19], any group member can sign on behalf of the group while remaining anonymous, but its identity can be traced in an future dispute investigation. Essentiall...
Victor K. Wei
PKC
2005
Springer
167views Cryptology» more  PKC 2005»
14 years 1 months ago
Converse Results to the Wiener Attack on RSA
A well-known attack on RSA with low secret-exponent d was given by Wiener about 15 years ago. Wiener showed that using continued fractions, one can efficiently recover the secret-...
Ron Steinfeld, Scott Contini, Huaxiong Wang, Josef...
ICN
2005
Springer
14 years 1 months ago
Scheduling Algorithms for Input Queued Switches Using Local Search Technique
Input Queued switches have been very well studied in the recent past. The Maximum Weight Matching (MWM) algorithm is known to deliver 100% throughput under any admissible traffic. ...
Yanfeng Zheng, Simin He, Shutao Sun, Wen Gao
PLDI
2004
ACM
14 years 1 months ago
Min-cut program decomposition for thread-level speculation
With billion-transistor chips on the horizon, single-chip multiprocessors (CMPs) are likely to become commodity components. Speculative CMPs use hardware to enforce dependence, al...
Troy A. Johnson, Rudolf Eigenmann, T. N. Vijaykuma...