Sciweavers

1568 search results - page 185 / 314
» The problem of examination questions in algorithmics
Sort
View
PPOPP
1993
ACM
15 years 10 months ago
Experience with Fine-Grain Synchronization in MIMD Machines for Preconditioned Conjugate Gradient
This paper discusses our experience with fine-grain synchronization for a variant of the preconditioned conjugate gradient method. This algorithm represents a large class of algo...
Donald Yeung, Anant Agarwal
ATAL
2008
Springer
15 years 8 months ago
Cost-based BDI plan selection for change propagation
Software maintenance is responsible for as much as two thirds of the cost of any software, and is consequently an important research area. In this paper we focus on the change pro...
Khanh Hoa Dam, Michael Winikoff
IADIS
2008
15 years 7 months ago
Customer Insights from Transactional Database: Database Marketing Case
Marketing databases are currently one of the most important resources in any marketing departments. Regarding their customer knowledge needs many of them had develop their own dat...
Filipe Mota Pinto, Alzira Ascensão Marques,...
SODA
2008
ACM
184views Algorithms» more  SODA 2008»
15 years 7 months ago
On the approximability of influence in social networks
In this paper, we study the spread of influence through a social network, in a model initially studied by Kempe, Kleinberg and Tardos [14, 15]: We are given a graph modeling a soc...
Ning Chen
SODA
2007
ACM
106views Algorithms» more  SODA 2007»
15 years 7 months ago
Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion
This paper addresses the basic question of how well can a tree approximate distances of a metric space or a graph. Given a graph, the problem of constructing a spanning tree in a ...
Ittai Abraham, Yair Bartal, Ofer Neiman