Sciweavers

2432 search results - page 299 / 487
» Using simple abstraction to reinvent computing for paralleli...
Sort
View
CSE
2009
IEEE
15 years 11 months ago
Structure of Neighborhoods in a Large Social Network
Abstract—We present here a method for analyzing the neighborhoods of all the vertices in a large graph. We first give an algorithm for characterizing a simple undirected graph t...
Alina Stoica, Christophe Prieur
BALT
2006
15 years 8 months ago
A Multiple Correspondence Analysis to Organize Data Cubes
Abstract. On Line Analytical Processing (OLAP) is a technology basically created to provide users with tools in order to explore and navigate into data cubes. Unfortunately, in hug...
Riadh Ben Messaoud, Omar Boussaid, Sabine Loudcher...
162
Voted
ICS
2010
Tsinghua U.
16 years 2 months ago
Cryptography by Cellular Automata or How Fast Can Complexity Emerge in Nature?
Computation in the physical world is restricted by the following spatial locality constraint: In a single unit of time, information can only travel a bounded distance in space. A ...
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
IPPS
2008
IEEE
15 years 11 months ago
Large-scale experiment of co-allocation strategies for Peer-to-Peer supercomputing in P2P-MPI
High Performance computing generally involves some parallel applications to be deployed on the multiples resources used for the computation. The problem of scheduling the applicat...
Stéphane Genaud, Choopan Rattanapoka
ICPPW
2009
IEEE
15 years 11 months ago
The Owner Share Scheduler for a Distributed System
Abstract—In large distributed systems, where shared resources are owned by distinct entities, there is a need to reflect resource ownership in resource allocation. An appropriat...
Jose Nelson Falavinha Junior, Aleardo Manacero Jun...