Sciweavers

1736 search results - page 249 / 348
» On antimagic directed graphs
Sort
View
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...
POS
1994
Springer
15 years 10 months ago
Hardware Support for Stability in a Persistent Architecture
Persistent stores support uniform management of data objects regardless of their lifetimes and locations. Such stores typically maintain a self-consistent state even after failure...
Frans A. Henskens, D. M. Koch, Rasool Jalili, John...
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
VLDB
1990
ACM
116views Database» more  VLDB 1990»
15 years 10 months ago
Factoring Augmented Regular Chain Programs
In previous papers we have proposed a graphical query language for expressing traversal recursions in labelled, directed graphs. A fundamental feature of the language is the use o...
Peter T. Wood
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