Sciweavers

68 search results - page 3 / 14
» er 1999
Sort
View
STACS
1999
Springer
13 years 9 months ago
Decidability and Undecidability of Marked PCP
We show that the marked version of the Post Correspondence Problem, where the words on a list are required to di er in the rst letter, is decidable. On the other hand, PCP remains ...
Vesa Halava, Mika Hirvensalo, Ronald de Wolf
IPPS
1999
IEEE
13 years 9 months ago
High-Performance Knowledge Extraction from Data on PC-Based Networks of Workstations
The automatic construction of classi ers programs able to correctly classify data collected from the real world is one of the major problems in pattern recognition and in a wide ar...
Cosimo Anglano, Attilio Giordana, Giuseppe Lo Bell...
ER
1999
Springer
146views Database» more  ER 1999»
13 years 9 months ago
"Modeling-by-Patterns" of Web Applications
“A pattern ... describes a problem which occurs over and over again in our environment, and then describes the core of the solution to that problem, in such a way that you can us...
Franca Garzotto, Paolo Paolini, Davide Bolchini, S...
ER
1999
Springer
110views Database» more  ER 1999»
13 years 9 months ago
A Survey of Current Methods for Integrity Constraint Maintenance and View Updating
During the process of updating a database, two interrelated problems could arise. On one hand, when an update is applied to the database, integrity constraints could become violat...
Enric Mayol, Ernest Teniente
ER
1999
Springer
152views Database» more  ER 1999»
13 years 9 months ago
Semantically Accessing Documents Using Conceptual Model Descriptions
. When publishing documents on the web, the user needs to describe and classify her documents for the benefit of later retrieval and use. This paper presents an approach to semanti...
Terje Brasethvik, Jon Atle Gulla