Sciweavers

943 search results - page 110 / 189
» How should data structures and algorithms be taught
Sort
View
IJCV
1998
238views more  IJCV 1998»
13 years 9 months ago
Feature Detection with Automatic Scale Selection
The fact that objects in the world appear in different ways depending on the scale of observation has important implications if one aims at describing them. It shows that the not...
Tony Lindeberg
ADBIS
2003
Springer
194views Database» more  ADBIS 2003»
14 years 2 months ago
Rule-Based Generation of XML DTDs from UML Class Diagrams
We present an approach of how to extract automatically an XML document structure from a conceptual data model that describes the content of a document. We use UML class diagrams as...
Thomas Kudrass, Tobias Krumbein
CGI
2004
IEEE
14 years 1 months ago
Fast and High Quality Overlap Repair for Patch-Based Texture Synthesis
Patch-based texture synthesis has proven to produce high quality textures faster than pixel-based approaches. Previous algorithms differ in how the regions of overlap between neig...
Andrew Nealen, Marc Alexa
SEMWEB
2009
Springer
14 years 3 months ago
Graph-Based Ontology Construction from Heterogenous Evidences
Abstract. Ontologies are tools for describing and structuring knowledge, with many applications in searching and analyzing complex knowledge bases. Since building them manually is ...
Christoph Böhm, Philip Groth, Ulf Leser
HICSS
1999
IEEE
98views Biometrics» more  HICSS 1999»
14 years 1 months ago
Retrieval of Volatile Database Output through Hypermedia Applications
This paper reports on research on the generation of hypermedia (Web) applications for querying multimedia databases. In [5] we have proposed a heuristic algorithm for generating n...
Geert-Jan Houben, Paul De Bra