Alternative titles of this paper would have been “Index theory without index” or “The Baum–Connes conjecture without Baum.” In 1989, Rieffel introduced an analytic version of deformation quantization based on the use of continuous fields ofC∗-algebras. We review how a wide variety of examples of such quantizations can be understood on the basis of a single lemma involving amenable groupoids. Th...

We show how to formalize approximate counting via hash functions in subsystems of bounded arithmetic, using variants of the weak pigeonhole principle. We discuss several applications, including a proof of the tournament principle, and an improvement on the known relationship of the collapse of the bounded arithmetic hierarchy to the collapse of the polynomial-time hierarchy.

Graph cut algorithms [9], commonly used in computer vision, solve a first-order MRF over binary variables. The state of the art for this NP-hard problem is QPBO [1, 2], which finds the values for a subset of the variables in the global minimum. While QPBO is very effective overall there are still many difficult problems where it can only label a small subset of the variables. We propose a new a...

and Applied Analysis 3 Step 1. Let F {a} be singleton. Then, there are u ∈ U and v ∈ V such that ‖uv‖ < M, and ‖ u, v, a − a‖ < M 1 . 2.2 Letting w uv ◦ uv, then ‖ uv ◦ uv, a − a‖ ‖ u, v, u, v, a − a − u, v, a − a ‖ < . 2.3 Step 2. Let F {a1, a2}. There is a u1, v1 ∈ U × V such that ‖ u1, v1, a1 − a1‖ < / 1 M , and for u1, v1, a2 − a2 ∈ A there is a u2, v2 ∈ U × V such that ‖ u2, v2, u1, v1, a2...

As networks continue to grow in size and complexity, distributed network monitoring and resource querying are becoming increasingly difficult. Our aim is to design, build, and evaluate a scalable infrastructure for answering queries over distributed measurements, at reduced costs (in terms of both network traffic and query latency) while maintaining required precision. In this infrastructure, e...