Length and area regularization are commonplace for inverse problems today. It has however turned out to be much more difficult to incorporate a curvature prior. In this paper we pr...
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
Abstract Colin Campbell, Wolfgang Grieskamp, Lev Nachmanson, Wolfram Schulte, Nikolai Tillmann, and Margus Veanes Microsoft Research, Redmond, WA, USA Abstract. We describe a pract...
Colin Campbell, Wolfgang Grieskamp, Lev Nachmanson...
The relative difference between two data values is of interest in a number of application domains including temporal and spatial applications, schema versioning, data warehousing...
John F. Roddick, Kathleen Hornsby, Denise de Vries
The management of large databases of hierarchical (e.g., multi-scale or multilevel) image features is a common problem in object recognition. Such structures are often represented ...