Sciweavers

9949 search results - page 1865 / 1990
» On the Network Complexity of Selection
Sort
View
MST
2002
169views more  MST 2002»
13 years 8 months ago
Bulk Synchronous Parallel Algorithms for the External Memory Model
Abstract. Blockwise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is f...
Frank K. H. A. Dehne, Wolfgang Dittrich, David A. ...
SCP
1998
107views more  SCP 1998»
13 years 8 months ago
A Distributed Arc-Consistency Algorithm
Consistency techniques are an e cient way of tackling constraint satisfaction problems (CSP). In particular, various arc-consistency algorithms have been designed such as the time...
T. Nguyen, Yves Deville
PUC
2002
143views more  PUC 2002»
13 years 8 months ago
TRIP: A Low-Cost Vision-Based Location System for Ubiquitous Computing
: Sentient Computing provides computers with perception so that they can react and provide assistance to user activities. Physical spaces are made sentient when they are wired with...
Diego López de Ipiña, Paulo R. S. Me...
SP
2002
IEEE
129views Security Privacy» more  SP 2002»
13 years 8 months ago
The XCAT Science Portal
The design and prototype implementation of the XCAT Grid Science Portal is described in this paper. The portal lets grid application programmers easily script complex distributed ...
Sriram Krishnan, Randall Bramley, Dennis Gannon, R...
TPDS
2002
126views more  TPDS 2002»
13 years 8 months ago
P-3PC: A Point-to-Point Communication Model for Automatic and Optimal Decomposition of Regular Domain Problems
One of the most fundamental problems automatic parallelization tools are confronted with is to find an optimal domain decomposition for a given application. For regular domain prob...
Frank J. Seinstra, Dennis Koelma
« Prev « First page 1865 / 1990 Last » Next »