Sciweavers

4355 search results - page 122 / 871
» Increasing Kolmogorov Complexity
Sort
View
IPM
2008
85views more  IPM 2008»
14 years 10 months ago
A new variant of the Pathfinder algorithm to generate large visual science maps in cubic time
In the last few years, there is an increasing interest to generate visual representations of very large scientific domains. A methodology based on the combined use of ISI
Arnaud Quirin, Oscar Cordón, Jose Santamar&...
JCM
2008
118views more  JCM 2008»
14 years 10 months ago
New Receiver Architecture Based on Optical Parallel Interference Cancellation for the Optical CDMA
Optical Code Division Multiple Access (OCDMA) is considered as the strongest candidates for the future high speed optical networks due to the large bandwidth offered by the system,...
N. Elfadel, A. A. Aziz, E. Idriss, A. Mohammed, N....
IEEEHPCS
2010
14 years 8 months ago
Timed protocols insecurity problem is NP-complete
—In this paper we study the protocol insecurity problem for time dependent security protocols with a finite number of sessions, extending to the timed case the results of M. Rus...
Massimo Benerecetti, Nicola Cuomo, Adriano Peron
INTERNET
2010
89views more  INTERNET 2010»
14 years 8 months ago
Smart Objects as Building Blocks for the Internet of Things
nstrate how the respective architectural abstractions support increasingly complex application. Gerd Kortuem and Fahim Kawsar Lancaster University Daniel Fitton University of Centr...
Gerd Kortuem, Fahim Kawsar, Vasughi Sundramoorthy,...
IPPS
2007
IEEE
15 years 4 months ago
File Creation Strategies in a Distributed Metadata File System
As computing breaches petascale limits both in processor performance and storage capacity, the only way that current and future gains in performance can be achieved is by increasi...
Ananth Devulapalli, Pete Wyckoff