Sciweavers

917 search results - page 51 / 184
» Comparison of Data Structures for Computing Formal Concepts
Sort
View
ICPR
2010
IEEE
14 years 10 months ago
Detection of Salient Image Points Using Principal Subspace Manifold Structure
—This paper presents a method to find salient image points in images with regular patterns based on deviations from the overall manifold structure. The two main contributions ar...
António R. C. Paiva, Tolga Tasdizen
EDOC
2006
IEEE
15 years 3 months ago
Enterprise Computing Systems as Information Factories
The analysis, and eventual approval or rejection, of new enterprise information technology (IT) initiatives often proceeds on the basis of informal estimates of return on investme...
K. Mani Chandy, Lu Tian, Daniel M. Zimmerman
TAGT
1998
Springer
184views Graph Theory» more  TAGT 1998»
15 years 1 months ago
A Framework for Adding Packages to Graph Transformation Approaches
Graphs are a commonly used formalism for modeling many different kinds of static and dynamic data. In many applications, data modeling can be improved by using hierarchically struc...
Giorgio Busatto, Gregor Engels, Katharina Mehner, ...
ECAI
2008
Springer
14 years 11 months ago
Approximate structure preserving semantic matching
Abstract. Typical ontology matching applications, such as ontology integration, focus on the computation of correspondences holding between the nodes of two graph-like structures, ...
Fausto Giunchiglia, Mikalai Yatskevich, Fiona McNe...
ICRA
2010
IEEE
81views Robotics» more  ICRA 2010»
14 years 8 months ago
Using recursive spectral registrations to determine brokenness as measure of structural map errors
—There are many common error sources that influence mapping, e.g., salt and pepper noise as well as other effects occurring quite uniformly distributed over the map. On the oth...
Andreas Birk