Sciweavers

2735 search results - page 546 / 547
» Comparing notions of randomness
Sort
View
DC
2011
12 years 8 months ago
Distributed algorithms for covering, packing and maximum weighted matching
Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...
Christos Koufogiannakis, Neal E. Young
IACR
2011
135views more  IACR 2011»
12 years 8 months ago
Algebraic Complexity Reduction and Cryptanalysis of GOST
Abstract. GOST 28147-89 is a well-known block cipher and the official encryption standard of the Russian Federation. Its large key size of 256 bits at a particularly low implementa...
Nicolas Courtois
CSCW
2012
ACM
12 years 4 months ago
Socializing volunteers in an online community: a field experiment
Although many off-line organizations give their employees training, mentorship, a cohort and other socialization experiences that improve their retention and productivity, online ...
Rosta Farzan, Robert Kraut, Aditya Pal, Joseph A. ...
CVPR
2012
IEEE
11 years 11 months ago
A learning based deformable template matching method for automatic rib centerline extraction and labeling in CT images
The automatic extraction and labeling of the rib centerlines is a useful yet challenging task in many clinical applications. In this paper, we propose a new approach integrating r...
Dijia Wu, David Liu, Zoltan Puskas, Chao Lu, Andre...
STOC
2007
ACM
134views Algorithms» more  STOC 2007»
14 years 9 months ago
Hardness of routing with congestion in directed graphs
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khann...