Sciweavers

4940 search results - page 378 / 988
» On the Complexity of Universal Programs
Sort
View
BIRTHDAY
2004
Springer
15 years 10 months ago
On Models for Quantified Boolean Formulas
A quantified Boolean formula is true, if for any existentially quantified variable there exists a Boolean function depending on the preceding universal variables, such that substi...
Hans Kleine Büning, Xishun Zhao
ERCIMDL
2006
Springer
115views Education» more  ERCIMDL 2006»
15 years 10 months ago
Introducing Pergamos: A Fedora-Based DL System Utilizing Digital Object Prototypes
This demonstration provides a "hands on" experience to the "internals" of Pergamos, the University of Athens DL System. Pergamos provides uniform high level DL ...
George Pyrounakis, Kostas Saidis, Mara Nikolaidou,...
DL
1995
Springer
15 years 10 months ago
Providing Government Information on the Internet: Experiences with THOMAS
The THOMAS system is designed to make legislative information available to the general public over the Internet, and can be regarded as a prototypeof a government digitallibrary. ...
W. Bruce Croft, Robert Cook, Dean Wilder
SEKE
1995
Springer
15 years 10 months ago
Visual Scenarios for Validation of Requirements Specification
The development of a large information system is generally regarded as one of the most complex activities undertaken by organizations and it is dependent on the communication and u...
V. Lalioti, Babis Theodoulidis
GLOBECOM
2009
IEEE
15 years 10 months ago
Iterative Versus Adaptive Equalizers in Time-Variant Channels
—This paper discusses the application of iterative versus adaptive equalizers to a Universal Mobile Telecommunications System (UMTS) High Speed Downlink Packet Access (HSDPA) rec...
Clemens Buchacher, Joachim Wehinger, Mario Huemer