Sciweavers

4075 search results - page 334 / 815
» Modeling Distributed Algorithm Using B
Sort
View
FGCS
2006
119views more  FGCS 2006»
15 years 6 months ago
OpenMP versus MPI for PDE solvers based on regular sparse numerical operators
Tw o parallel programming models represented b y OpenMP and MPI are compared for PDE solvers based on regular sparse numerical operators. As a typical representative of such an app...
Markus Nordén, Sverker Holmgren, Michael Th...
ANSS
2007
IEEE
16 years 1 months ago
Scalable Data Collection Protocols for Wireless Sensor Networks with Multiple Mobile Sinks
Data propagation in wireless sensor networks is usually performed as a multihop process. To deliver a single message, the resources of many sensor nodes are used and a lot of ener...
Athanasios Kinalis, Sotiris E. Nikoletseas
IPPS
2002
IEEE
15 years 11 months ago
On Cost-Optimal Merge of Two Intransitive Sorted Sequences
The problem of merging two intransitive sorted sequences (that is, to generate a sorted total order without the transitive property) is considered. A cost-optimal parallel merging...
Jie Wu, Stephan Olariu
PODC
2010
ACM
15 years 10 months ago
Group mutual exclusion in O(log n) RMR
We present an algorithm to solve the GROUP MUTUAL EXCLUSION problem in the cache-coherent (CC) model. For the same problem in the distributed shared memory (DSM) model, Danek and ...
Vibhor Bhatt, Chien-Chung Huang
NIPS
2001
15 years 8 months ago
Categorization by Learning and Combining Object Parts
We describe an algorithm for automatically learning discriminative components of objects with SVM classifiers. It is based on growing image parts by minimizing theoretical bounds ...
Bernd Heisele, Thomas Serre, Massimiliano Pontil, ...