3190 search results - page 600 / 638 » cans 2011 |
124
click to vote
COMPGEOM
2011
ACM
14 years 4 months ago
2011
ACM
We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum o...
242
Voted
COMPGEOM
2011
ACM
14 years 4 months ago
2011
ACM
We introduce a new notion of minors for simplicial complexes (hypergraphs), so-called homological minors. Our motivation is to propose a general approach to attack certain extrema...
137
Voted
COMPGEOM
2011
ACM
14 years 4 months ago
2011
ACM
Given a continuous function f : X → IR on a topological space X, its level set f−1 (a) changes continuously as the real value a changes. Consequently, the connected components...
108
click to vote
CORR
2011
Springer
14 years 4 months ago
2011
Springer
Abstract—Set intersection is the core in a variety of problems, e.g. frequent itemset mining and sparse boolean matrix multiplication. It is well-known that large speed gains can...
125
click to vote
CORR
2011
Springer
14 years 4 months ago
2011
Springer
—This paper addresses the problem of simultaneous signal recovery and dictionary learning based on compressive measurements. Multiple signals are analyzed jointly, with multiple ...