Sciweavers

306 search results - page 17 / 62
» Parameterized matching with mismatches
Sort
View
AAAI
2007
13 years 10 months ago
Partial Matchmaking using Approximate Subsumption
Description Logics, and in particular the web ontology language OWL has been proposed as an appropriate basis for computing matches between structured objects for the sake of info...
Heiner Stuckenschmidt
SMI
2008
IEEE
107views Image Analysis» more  SMI 2008»
14 years 2 months ago
Approximate topological matching of quadrilateral meshes
Abstract In this paper, we study the problem of approximate topological matching for quadrilateral meshes, that is, the problem of finding as large a set as possible of matching p...
David Eppstein, Michael T. Goodrich, Ethan Kim, Ra...
GCC
2005
Springer
14 years 1 months ago
A Mathematical Foundation for Topology Awareness of P2P Overlay Networks
Abstract. In peer-to-peer (P2P) overlay networks, the mechanism of a peer randomly joining and leaving a network, causes a topology mismatch between the overlay and the underlying ...
Habib Rostami, Jafar Habibi
SIGGRAPH
2010
ACM
13 years 12 months ago
Seeing is believing: body motion dominates in multisensory conversations
In many scenes with human characters, interacting groups are an important factor for maintaining a sense of realism. However, little is known about what makes these characters app...
Cathy Ennis, Rachel McDonnell, Carol O'Sullivan
CPM
2005
Springer
206views Combinatorics» more  CPM 2005»
14 years 1 months ago
A Fast Algorithm for Approximate String Matching on Gene Sequences
Abstract. Approximate string matching is a fundamental and challenging problem in computer science, for which a fast algorithm is highly demanded in many applications including tex...
Zheng Liu, Xin Chen, James Borneman, Tao Jiang