Sciweavers

95 search results - page 15 / 19
» Top-k subgraph matching query in a large graph
Sort
View
CGF
1999
125views more  CGF 1999»
13 years 7 months ago
Partitioning and Handling Massive Models for Interactive Collision Detection
We describe an approach for interactive collision detection and proximity computations on massive models composed of millions of geometric primitives. We address issues related to...
Andy Wilson, Eric Larsen, Dinesh Manocha, Ming C. ...
CVPR
1997
IEEE
13 years 11 months ago
FOCUS: Searching for Multi-colored Objects in a Diverse Image Database
We describe a new multi-phase, color-based image retrieval system, FOCUS Fast Object Color-based qUery System, with an online user interface which is capable of identifying mult...
Madirakshi Das, Edward M. Riseman, Bruce A. Draper
ECCV
2010
Springer
13 years 11 months ago
Feature tracking for wide-baseline image retrieval
We address the problem of large scale image retrieval in a wide-baseline setting, where for any query image all the matching database images will come from very different viewpoint...
STACS
2007
Springer
14 years 1 months ago
Testing Convexity Properties of Tree Colorings
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
Eldar Fischer, Orly Yahalom
ICCS
2009
Springer
14 years 2 months ago
Distinguishing Answers in Conceptual Graph Knowledge Bases
Abstract. In knowledge bases, the open world assumption and the ability to express variables may lead to an answer redundancy problem. This problem occurs when the returned answers...
Nicolas Moreau, Michel Leclère, Madalina Cr...