Sciweavers

721 search results - page 91 / 145
» Almost universal graphs
Sort
View
EJC
2006
13 years 10 months ago
Perfect matchings in uniform hypergraphs with large minimum degree
A perfect matching in a k-uniform hypergraph on n vertices, n divisible by k, is a set of n/k disjoint edges. In this paper we give a sufficient condition for the existence of a p...
Vojtech Rödl, Andrzej Rucinski, Endre Szemer&...
COMSIS
2007
80views more  COMSIS 2007»
13 years 10 months ago
"Security of Computer Systems and Networks" Book Preview
This paper presents preview of the new book titled “Security of Computer Systems and Networks” (original in Serbian language “Sigurnost računarskih sistema i mreža”) – ...
Dragan Pleskonjic, Nemanja Macek, Borislav Djordje...
EJIS
2007
87views more  EJIS 2007»
13 years 10 months ago
Identifying healthcare actors involved in the adoption of information systems
The adoption of information systems in healthcare is no less significant than in any other commercial or caring organisation. The literature on IS adoption in healthcare, makes it...
Vasiliki Mantzana, Marinos Themistocleous, Zahir I...
JCP
2007
153views more  JCP 2007»
13 years 9 months ago
An Integrated Educational Platform Implementing Real, Remote Lab-Experiments for Electrical Engineering Courses
—This paper describes an Internet-based laboratory, named Remote Monitored and Controlled Laboratory (RMCLab) developed at University of Patras, Greece, for electrical engineerin...
Dimitris Karadimas, Kostas Efstathiou
TIT
2002
78views more  TIT 2002»
13 years 9 months ago
Tradeoffs between the excess-code-length exponent and the excess-distortion exponent in lossy source coding
Lossy compression of a discrete memoryless source (DMS) with respect to a single-letter distortion measure is considered. We study the best attainable tradeoff between the exponent...
Tsachy Weissman, Neri Merhav