Sciweavers

2294 search results - page 342 / 459
» From Path Graphs to Directed Path Graphs
Sort
View
DATE
2007
IEEE
146views Hardware» more  DATE 2007»
16 years 19 days ago
Data-flow transformations using Taylor expansion diagrams
Abstract: An original technique to transform functional representation of the design into a structural representation in form of a data flow graph (DFG) is described. A canonical,...
Maciej J. Ciesielski, Serkan Askar, Daniel Gomez-P...
ECCV
2010
Springer
15 years 10 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...
SIGCOMM
1992
ACM
15 years 10 months ago
Internet Routing Over Large Public Data Networks Using Shortcuts
With the emergence of large switched public data networks that are well-suited to connectionless internets, for instance SMDS, it is possible that larger and larger numbers of int...
Paul F. Tsuchiya
CIE
2009
Springer
15 years 10 months ago
Functions Definable by Arithmetic Circuits
An arithmetic circuit is a labelled, directed, acyclic graph specifying a cascade of arithmetic and logical operations to be performed on sets of non-negative integers. In this pap...
Ian Pratt-Hartmann, Ivo Düntsch
DEXA
2006
Springer
138views Database» more  DEXA 2006»
15 years 10 months ago
A Vector Space Model for Semantic Similarity Calculation and OWL Ontology Alignment
Ontology alignment (or matching) is the operation that takes two ontologies and produces a set of semantic correspondences (usually semantic similarities) between some elements of ...
Rubén Tous, Jaime Delgado