2681 search results - page 202 / 537 » Problem F |
123
click to vote
SIGMOD
2003
ACM
16 years 26 days ago
2003
ACM
Most previous solutions to the schema matching problem rely in some fashion upon identifying "similar" column names in the schemas to be matched, or by recognizing commo...
101
click to vote
SCALESPACE
2007
Springer
15 years 6 months ago
2007
Springer
In this work, we address the problem of segmenting multiple objects, under possible occlusions, in a level set framework. A variational energy that incorporates a piecewise constan...
104
Voted
ALGORITHMICA
2007
15 years 25 days ago
2007
A tree t-spanner T in a graph G is a spanning tree of G such that the distance between every pair of vertices in T is at most t times their distance in G. The tree t-spanner proble...
197
Voted
COMPGEOM
2011
ACM
14 years 4 months ago
2011
ACM
We propose a framework for compressive sensing of images with local geometric features. Specifically, let x ∈ RN be an N-pixel image, where each pixel p has value xp. The image...
101
click to vote
COMPGEOM
2005
ACM
15 years 2 months ago
2005
ACM
Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...