Sciweavers

154 search results - page 27 / 31
» Odd subgraphs and matchings
Sort
View
ICCS
1997
Springer
14 years 1 months ago
The CG Mars Lander
The name of the system is \THE CG MARS LANDER", which stands forType Hierarchy Enhanced CGMatching And Retrieval SystemLinear Associative N-tuple Deductive Embedded Representa...
Gil Fuchs, Robert Levinson
FODO
1998
Springer
214views Algorithms» more  FODO 1998»
14 years 1 months ago
Querying Composite Objects in Semistructured Data
In this paper, we propose an entity-based style of queries for semistructured data. First, we partition a semistructured data into subgraphs corresponding to real-world entities, ...
Keishi Tajima
CORR
2010
Springer
170views Education» more  CORR 2010»
13 years 9 months ago
Rule-based Generation of Diff Evolution Mappings between Ontology Versions
Ontologies such as taxonomies, product catalogs or web directories are heavily used and hence evolve frequently to meet new requirements or to better reflect the current instance d...
Michael Hartung, Anika Gross, Erhard Rahm
ECCC
2006
70views more  ECCC 2006»
13 years 9 months ago
Finding a Heaviest Triangle is not Harder than Matrix Multiplication
We show that for any > 0, a maximum-weight triangle in an undirected graph with n vertices and real weights assigned to vertices can be found in time O(n + n2+), where is the ...
Artur Czumaj, Andrzej Lingas
CG
2007
Springer
13 years 9 months ago
Graphtracker: A topology projection invariant optical tracker
In this paper, we describe a new optical tracking algorithm for pose estimation of interaction devices in virtual and augmented reality. Given a 3D model of the interaction device...
Ferdi A. Smit, Arjen van Rhijn, Robert van Liere