Sciweavers

11397 search results - page 144 / 2280
» A Relational Abstraction for Functions
Sort
View
157
Voted
COCOA
2009
Springer
15 years 11 months ago
Computing the Transitive Closure of a Union of Affine Integer Tuple Relations
Abstract. This paper proposes a method to compute the transitive closure of a union of affine relations on integer tuples. Within Presburger arithmetics, complete algorithms to com...
Anna Beletska, Denis Barthou, Wlodzimierz Bielecki...
175
Voted
ER
1995
Springer
109views Database» more  ER 1995»
15 years 10 months ago
Reverse Engineering of Relational Database Applications
Abstract. This paper presents techniques for reverse engineering of relational database applications. The target of such an effort is the definition of a fully equipped object-orie...
Mark W. W. Vermeer, Peter M. G. Apers
186
Voted
BIRD
2008
Springer
159views Bioinformatics» more  BIRD 2008»
15 years 9 months ago
Exploration of Evolutionary Relations between Protein Structures
Abstract. We describe a new method for the exploration of evolutionary relations between protein structures. The approach is based on the ESSM algorithm for detecting structural mu...
Natalja Kurbatova, Juris Viksna
TROB
2008
121views more  TROB 2008»
15 years 6 months ago
A Relational Positioning Methodology for Robot Task Specification and Execution
Abstract--This paper presents a relational positioning methodology that allows to restrict totally or partially the movements of an object by specifying its allowed positions in te...
Adolfo Rodriguez, Luis Basañez, Enric Celay...
176
Voted
JUCS
2008
140views more  JUCS 2008»
15 years 7 months ago
The Computable Multi-Functions on Multi-represented Sets are Closed under Programming
: In the representation approach to computable analysis (TTE) [Grz55, i00], abstract data like rational numbers, real numbers, compact sets or continuous real functions are represe...
Klaus Weihrauch