Sciweavers

2392 search results - page 277 / 479
» Matching data dissemination algorithms to application requir...
Sort
View
SC
2003
ACM
15 years 12 months ago
Compiler Support for Exploiting Coarse-Grained Pipelined Parallelism
The emergence of grid and a new class of data-driven applications is making a new form of parallelism desirable, which we refer to as coarse-grained pipelined parallelism. This pa...
Wei Du, Renato Ferreira, Gagan Agrawal
MOBIHOC
2008
ACM
16 years 6 months ago
Delay-bounded routing in vehicular ad-hoc networks
Ad hoc networks formed by traveling vehicles are envisaged to become a common platform that will support a wide variety of applications, ranging from road safety to advertising an...
Antonios Skordylis, Niki Trigoni
LCN
2007
IEEE
16 years 27 days ago
Experiments on Network Services for the Grid
—For demanding Grid applications that use resources at different cluster sites a reservation mechanism ensures the availability of resources to guarantee a certain level of QoS. ...
Christoph Barz, Peter Martini, Markus Pilz, Floria...
SIGMOD
2008
ACM
107views Database» more  SIGMOD 2008»
16 years 6 months ago
Outlier-robust clustering using independent components
How can we efficiently find a clustering, i.e. a concise description of the cluster structure, of a given data set which contains an unknown number of clusters of different shape ...
Christian Böhm, Christos Faloutsos, Claudia P...
ESA
2008
Springer
134views Algorithms» more  ESA 2008»
15 years 8 months ago
A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry
The edge asymmetry of a directed, edge-weighted graph is defined as the maximum ratio of the weight of antiparallel edges in the graph, and can be used as a measure of the heterog...
Spyros Angelopoulos