For a long time computer scientists have distinguished between fast and slow algorithms. Fast (or good) algorithms are the algorithms that run in polynomial time, which means that the number of steps required for the algorithm to solve a problem is bounded by some polynomial in the length of the input. All other algorithms are slow (or bad)....
With the increasing popularization of the Internet, together with the rapid
development of 3D scanning technologies and modeling tools, 3D model
databases have become more and more common in fields such as biology,
chemistry, archaeology and geography. People can distribute their own 3D works
over the Internet, search and download 3D...
Programming is a fascinating and challenging subject. Unfortunately, it is rarely presented as such. Most often it is taught by "induction": features of some famous programming languages are given operational meaning (e.g. a loop "goes round and round"), a number of examples are shown, and by induction, we are asked to...
Artificial neural networks, or simply called neural networks, refer to the
various mathematical models of human brain functions such as perception,
computation and memory. It is a fascinating scientific challenge of our time to
understand how the human brain works. Modeling neural networks facilitates
us in investigating the...
This book contains papers first presented at the 4th International Workshop on Field-
Programmable Logic and Applications (FPL'94), held in Prague, Czech Republic,
September 7 - 9, 1994.
The FPL'94 workshop was organized by the Czech Technical University and the University
of Kaiserslautern, in co-operation with IEEE...
Since the 1960s, database systems have been playing a relevant role in the
information technology field. By the mid-1960s, several systems were also available
for commercial purposes. Hierarchical and network database systems provided
two different perspectives and data models to organize data collections. In 1970,
E. Codd wrote a...
This book represents my 30 years continuing education courses for graduate and
master degree students at the Electronics and Telecommunications Faculty from
the Technical University of Cluj Napoca, Romania and partially my research activity
too. The presented topics are useful for engineers, M.Sc. and PhD students
who need basics in...
With the unprecedented rate at which data is being collected today in almost all
elds of human endeavor, there is an emerging economic and scienti c need to
extract useful information from it. For example, many companies already have
data-warehouses in the terabyte range (e.g., FedEx, Walmart). The World Wide
Web has an estimated 800...
This volume is based on the International Conference Logic at Work, held in Amsterdam, The Netherlands, in December 1992. The 14 papers in this volume are selected from 86 submissions and 8 invited contributions and are all devoted to knowledge representation and reasoning under uncertainty, which are core issues of formal artificial...
During the 1980's the flat relational model (relational model), which was initiated by
Codd in 1970, gained immense popularity and acceptance in the market place. One of
the main reasons for this success is that the relational model provides physical data
independences i.e. changing the physical organization of the database does not...
The recent remarkable developments of interior point algorithms began in 1984 with
Karmarkar's polynomial-time interior point algorithm for linear programs using a log-
arithmic potential function and a projective transformation. The progress has been
made so rapidly and extensively that it seems difficult to get a comprehensive...
These Lecture Notes are based on a series of lectures I gave at the Linkoping University
Department of Electrical Engineering in 1988. In these lectures 1 tried to give an overview
of the theory of representation of compact groups and some applications in the fields of
image science and pattern recognition.
