22.06.16 46:12 Provable Submodular Minimization via Wolfe’s Algorithm
Owing to several applications in large scale learning and vision problems, fast submodular function minimization (SFM) has become a critical problem.
274
22.06.16 1:05:39 A Faster Cutting Plane Method and its Implications for Combinatorial and Convex Optimization
In this talk, I will present a new algorithm for finding a point in a convex set given a separation oracle.
775
64.2
22.06.16 20:24 Stochastic Methods for Complex Performance Measures: A Tale of Two Families
Stochastic Methods for Complex Performance Measures: A Tale of Two Families
128
22.06.16 44:32 Parallel Bayesian Network Structure Learning for Genome-Scale Gene Networks
Learning Bayesian networks is NP-hard. Even with recent progress in heuristic and parallel algorithms, modeling capabilities still fall short of the scale of the problems encountered.
445
29.2
22.06.16 57:15 Empirical Inference for Intelligent Systems
Empirical Inference is the process of drawing conclusions from observational data.
444
18.2
22.06.16 17:31 Ordered Stick-breaking Prior for Sequential MCMC Inference of Bayesian Non-Parametric Models
Ordered Stick-breaking Prior for Sequential MCMC Inference of Bayesian Non-Parametric Models
470
156.3
22.06.16 1:00:24 Effective-Resistance-Reducing Flows, Spectrally Thin Trees and Asymmetric TSP
We show that the integrality gap of the natural LP relaxation of the Asymmetric Traveling Salesman Problem is at most polyloglog(n).
240
22.06.16 50:40 Non-Convex Robust PCA
In this lecture, we will illustrate a novel technique due to Erdos et al. (2011) which can be used to obtain bounds on eigenvector perturbation in the ℓ ∞ norm.
975
80.8
22.06.16 1:01:05 Communication-Avoiding Algorithms and Fast Matrix Multiplication
As our computing capabilities grow, the size and complexity of numerical simulations and data analysis that today's computational scientists conduct continue to increase.
970
14.4
22.06.16 1:52:37 The Forza Motorsport 5 Original Soundtrack, An Insider's View
The session "The Forza Motorsport 5 Original Soundtrack, An Insider's View" is a detailed look at how the soundtrack to the one of the first next gen video game soundtracks for the Xbox One was
2 652
30.1
21.06.16 36:24 Reasoning about GADT Pattern Matching in Haskell
Generalized Algebraic Data Types (GADTs) are a simple but powerful generalization of Algebraic Data Types (ADTs) in Haskell and the ML family.
3 826
79.3
21.06.16 47:46 Non-Convex Robust PCA - Part 2
In this lecture, we will illustrate a novel technique due to Erdos et al. (2011) which can be used to obtain bounds on eigenvector perturbation in the ℓ ∞ norm.
192
21.06.16 57:28 Modeling, Quantifying, and Limiting Adversary Knowledge
Users participating in online services are required to relinquish control over potentially sensitive personal information, exposing them to intentional or unintentional miss-use of said information
11
21.06.16 1:02:07 Sampling Techniques for Constraint Satisfaction and Beyond
Constraint problems have played a key role in diverse areas spanning testing, formal verification, planning, inferencing and the like.
144
21.06.16 26:33 Cell Classification of FT-IR Spectroscopic Data for Histopathology using Neural Networks
FT-IR spectroscopy has shown potential as an imaging modality for cancer detection.
840
22.9
21.06.16 1:06:03 Sequential Equilibrium Distributions in Multi-Stage Games with Infinite Sets of Types and Actions
We consider the question of how to define of sequential equilibria for multi-stage games with infinite type sets and infinite action sets.
224
21.06.16 53:19 Randomized Interior Point Methods for Sampling and Optimization
We present a Markov Chain, "Dikin walk", for sampling from a convex body equipped with a self-concordant barrier.
409
45.1
21.06.16 1:12:43 Introduction to large-scale optimization - Part1
These lectures will cover both basics as well as cutting-edge topics in large-scale convex and nonconvex optimization (continuous case only).
3 907
26.8
21.06.16 20:13 Welcome and Microsoft Research Asia Update
Welcome and Microsoft Research Asia Update
19
21.06.16 50:24 An average-case depth hierarchy theorem for Boolean circuits
We prove an average-case depth hierarchy theorem for Boolean circuits over the standard basis of AND, OR, and NOT gates.
195
21.06.16 43:50 Enabling Connected Cars through Named Data.
Vehicular networks have been investigated by industry and academia for over a decade yet no actual deployments are on the road today; this due to inadequate technical solutions and a vertical market
361
29.8
21.06.16 1:40:48 Introduction to large-scale optimization - Part 2
These lectures will cover both basics as well as cutting-edge topics in large-scale convex and nonconvex optimization (continuous case only).
741
14.2
21.06.16 1:57:52 Human Computer Interaction Mini-Symposium: Four Provocations from the Frontiers of HCI
Roel Vertegaal - Queen's University Talk Title: Towards Real Reality (RR) Displays: Some Challenges in Using Flexible Displays for Pixels on Real Objects Abstract: In this presentation, I will argue
403
134
21.06.16 53:05 Lottery Auctions
The talk discusses some single object sale lottery auctions (LA), where the winner is randomly drawn, with a probability proportional to the price bid.
93
21.06.16 19:26 ResearchNext: Data-driven discovery and the Cloud
We live in an information society, with cloud computing changing the way we live, work and play in a world of devices and services.
65
21.06.16 19:50 A Spectral Algorithm for Ranking using Seriation.
We describe a seriation algorithm for ranking a set of items given pairwise comparisons between these items.
217
21.06.16 52:37 Symmetric and Asymmetric k-center Clustering under Stability
The k-center problem is a canonical and long-studied facility location and clustering problem with many applications in both its symmetric and asymmetric forms.
1 027
68.1
21.06.16 15:49 Types and Logic, Concurrency and Non-Determinism
Types and Logic, Concurrency and Non-Determinism
236
21.06.16 1:12:48 Introduction to Large-Scale Optimization - Part3
These lectures will cover both basics as well as cutting-edge topics in large-scale convex and nonconvex optimization (continuous case only).
547
16.2