Sciweavers

2365 search results - page 138 / 473
» All things are connected
Sort
View
ICALP
2003
Springer
15 years 11 months ago
Sophistication Revisited
Kolmogorov complexity measures the ammount of information in a string as the size of the shortest program that computes the string. The Kolmogorov structure function divides the s...
Luis Antunes 0002, Lance Fortnow
ISAAC
2003
Springer
96views Algorithms» more  ISAAC 2003»
15 years 11 months ago
On the Geometric Dilation of Finite Point Sets
Let G be an embedded planar graph whose edges may be curves. For two arbitrary points of G, we can compare the length of the shortest path in G connecting them against their Euclid...
Annette Ebbers-Baumann, Ansgar Grüne, Rolf Kl...
ICPR
2002
IEEE
15 years 11 months ago
A Perceptual Shape Descriptor
The proposed shape descriptor is based on the beams originated from a boundary point, which are defined as lines connecting that point with the rest of the points on the boundary....
Nafiz Arica, Fatos T. Yarman-Vural
LICS
2000
IEEE
15 years 11 months ago
Precongruence Formats for Decorated Trace Preorders
This paper explores the connection between semantic equivalences and preorders for concrete sequential processes, represented by means of labelled transition systems, and formats ...
Bard Bloom, Wan Fokkink, Rob J. van Glabbeek
CC
2007
Springer
15 years 10 months ago
Program Refactoring, Program Synthesis, and Model-Driven Development
Program refactoring, feature-based and aspect-oriented software synthesis, and model-driven development are disjoint research areas. However, they are all architectural metaprogram...
Don S. Batory