5153 search results - page 931 / 1031 » Introduction to Randomized Algorithms |
115
Voted
IACR
2011
14 years 2 months ago
2011
Traditional approaches to secure computation begin by representing the function f being computed as a circuit. For any function f that depends on each of its inputs, this implies ...
148
Voted
STOC
2010
ACM
15 years 12 months ago
2010
ACM
We present a generic method for converting any family of unsatisfiable CNF formulas that require large resolution rank into CNF formulas whose refutation requires large rank for p...
138
click to vote
ISCA
2005
IEEE
15 years 8 months ago
2005
IEEE
Minimizing latency and maximizing throughput are important goals in the design of routing algorithms for interconnection networks. Ideally, we would like a routing algorithm to (a...
135
click to vote
CVPR
2004
IEEE
16 years 4 months ago
2004
IEEE
Model-based clustering of motion trajectories can be posed as the problem of learning an underlying mixture density function whose components correspond to motion classes with dif...
123
Voted
CVPR
2008
IEEE
16 years 4 months ago
2008
IEEE
High-level generative models provide elegant descriptions of videos and are commonly used as the inference framework in many unsupervised motion segmentation schemes. However, app...