Sciweavers

2492 search results - page 38 / 499
» On the General Signature Trees
Sort
View
WG
1999
Springer
13 years 12 months ago
Finding Smallest Supertrees Under Minor Containment
The diversity of application areas relying on tree-structured data results in wide interest in algorithms which determine differences or similarities among trees. One way of meas...
Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thi...
EUROPKI
2004
Springer
13 years 11 months ago
On the Synergy Between Certificate Verification Trees and PayTree-like Micropayments
Abstract. A substantial number of micropayment schemes in the literature are based on distributing the cost of a digital signature over several successive micropayments (e.g. Paywo...
Josep Domingo-Ferrer
ALGORITHMICA
2007
80views more  ALGORITHMICA 2007»
13 years 7 months ago
Tree Spanners for Bipartite Graphs and Probe Interval Graphs
A tree t-spanner T in a graph G is a spanning tree of G such that the distance between every pair of vertices in T is at most t times their distance in G. The tree t-spanner proble...
Andreas Brandstädt, Feodor F. Dragan, Ho&agra...
GIS
2006
ACM
14 years 8 months ago
Recognition of island structures for map generalization
In this paper we describe work on the automatic recognition of island structures. In an initial phase several test persons were asked to mark groups of islands that they perceived...
Stefan Steiniger, Dirk Burghardt, Robert Weibel
BIRTHDAY
2009
Springer
14 years 2 months ago
Formal Series of General Algebras over a Field and Their Syntactic Algebras
Any mapping S : C → K, where K is a field and C = (C, Σ) is a Σ-algebra, is called a KC-series. These series are natural generalizations of both formal series on strings over...
Zoltán Fülöp, Magnus Steinby