Sciweavers

240 search results - page 34 / 48
» Maximal Contiguous Degrees
Sort
View
ISCC
2002
IEEE
131views Communications» more  ISCC 2002»
14 years 10 days ago
Scheduling real time parallel structure on cluster computing
: - Efficient task scheduling is essential for achieving high performance computing applications for distributed systems. Most of existing real-time systems consider schedulability...
Reda A. Ammar, Abdulrahman Alhamdan
SPAA
2010
ACM
14 years 6 days ago
Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
Matti Åstrand, Jukka Suomela
ICPR
2000
IEEE
13 years 11 months ago
Boundary Estimation from Intensity/Color Images with Algebraic Curve Models
A new concept and algorithm are presented for noniterative robust estimation of piecewise smooth curves of maximal edge strength in small image windows – typically  ¢¡£  to...
Tolga Tasdizen, David B. Cooper
IPPS
1998
IEEE
13 years 11 months ago
Hyper Butterfly Network: A Scalable Optimally Fault Tolerant Architecture
Boundeddegreenetworks like deBruijn graphsor wrapped butterfly networks are very important from VLSI implementation point of view as well as for applications where the computing n...
Wei Shi, Pradip K. Srimani
VLDB
1997
ACM
86views Database» more  VLDB 1997»
13 years 11 months ago
Using Probabilistic Information in Data Integration
The goal of a mediator system is to provide users a uniform interface to the multitude of information sources. To translate user queries, given in a mediated schema, to queries on...
Daniela Florescu, Daphne Koller, Alon Y. Levy