2907 search results - page 185 / 582 » Presentations of Structures in Admissible Sets |
166
click to vote
ENTCS
2007
15 years 6 months ago
2007
The rewrite-based approach to satisfiability modulo theories consists of using generic theorem-proving strategies for first-order logic with equality. If one can prove that an i...
181
click to vote
JMLR
2010
15 years 1 months ago
2010
In recent years, a fundamental problem structure has emerged as very useful in a variety of machine learning applications: Submodularity is an intuitive diminishing returns proper...
178
click to vote
CVPR
2005
IEEE
16 years 8 months ago
2005
IEEE
We present a new method for generating large numbers of accurate point correspondences between two wide baseline images. This is important for structure-from-motion algorithms, wh...
172
click to vote
WEBDB
2009
Springer
16 years 1 months ago
2009
Springer
We study the problem of automatically discovering semantic associations between schema elements, namely foreign keys. This problem is important in all applications where data sets...
166
click to vote
ESA
2003
Springer
15 years 11 months ago
2003
Springer
This paper presents a dynamic algorithm for the construction of the Euclidean Voronoi diagram of a set of convex objects in the plane. We consider first the Voronoi diagram of smo...