1552 search results - page 246 / 311 » On the Complexity of Constant Propagation |
103
click to vote
SODA
2008
ACM
15 years 1 months ago
2008
ACM
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...
ESANN
2001
15 years 1 months ago
2001
Abstract. An approach to symbolic contour extraction will be described that consists of three stages: enhancement, detection, and extraction of edges and corners. Edges and corners...
NIPS
2001
15 years 1 months ago
2001
Probabilistic mixture models are used for a broad range of data analysis tasks such as clustering, classification, predictive modeling, etc. Due to their inherent probabilistic na...
SCS
2004
15 years 1 months ago
2004
Railways, like a lot of industries are becoming increasingly reliant on programmable technology for safety. The development of railway technology is however largely driven through...
OPODIS
2003
15 years 1 months ago
2003
A fundamental problem in distributed computing is performing a set despite failures and delays. Stated abstractly, the problem is to perform N tasks using P failure-prone processor...