23 search results - page 2 / 5 » Minimizing the stabbing number of matchings, trees, and tria... |
CVPR
2003
IEEE
14 years 9 months ago
2003
IEEE
We describe some techniques that can be used to represent and detect deformable shapes in images. The main difficulty with deformable template models is the very large or infinite...
DEXA
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Semantic matching of schemas in heterogeneous data sharing systems is time consuming and error prone. Existing mapping tools employ semi-automatic techniques for mapping ...
EDBT
2004
ACM
14 years 7 months ago
2004
ACM
This paper presents a framework for understanding and constructing access methods for versioned data. Records are associated with version ranges in a version tree. A minimal repre...
SODA
2010
ACM
14 years 4 months ago
2010
ACM
We consider the following model for fire containment. We are given an undirected graph G = (V, E) with a source vertex s where the fire starts. At each time step, the firefighters...
STOC
1993
ACM
13 years 11 months ago
1993
ACM
We consider a class of routing problems on connected graphs G. Initially, each vertex v of G is occupied by a “pebble” which has a unique destination π(v) in G (so that π is...