Matrix Factorization for Clustering: NMF and Beyond A probabilistic analysis for the Feedback Vertex Set problem Design and Analysis of Local Kernel Machines Convergence of local interactions in catalan structures Capacity Allocation in Queueing Networks Towards the KLS Conjecture for Convex Bodies Walk Fast Distributively and Learn despite Byzantine Failures
Circular-Secure Encryption from Learning Problems Effcient Allocations when the Agents have Submodular
Utility/Cost Function Reconstruction in random factor graphs Effcient Approaches for Random Walks
Models for Routing and Social Complex Networks Routing Protocol
Spring 2010
Fall 2009
Collaboration Mechanism Design under Data Uncertainty
in Multicommodity Flow Networks
Cluster Algorithms for Discrete Models of Colloids
Spring 2009
Summer 2008
Budget-Constrained Auctions
Random Sampling via Geometric Coupling
Searching for the Core with Column Generation
Spring 2008
Protein structure/Hit-and-run sampling
Spam Filtering
Path Splicing
Skyline Computation
Reconstruction and Clustering in Random Constraint Satisfaction Problems
Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
|
||||||||||||||||||||||||||
