149 search results - page 24 / 30 » On Finding Minimum Deadly Sets for Directed Networks |
WINE
2010
Springer
13 years 5 months ago
2010
Springer
We study the optimal pricing strategies of a monopolist selling a divisible good (service) to consumers that are embedded in a social network. A key feature of our model is that c...
ESANN
2006
13 years 9 months ago
2006
We investigate when sparse coding of sensory inputs can improve performance in a classification task. For this purpose, we use a standard data set, the MNIST database of handwritte...
HICSS
2003
IEEE
14 years 23 days ago
2003
IEEE
The discovery of sequential patterns, which extends beyond frequent item-set finding of association rule mining, has become a challenging task due to its complexity. Essentially, ...
IPPS
2002
IEEE
14 years 12 days ago
2002
IEEE
In a paper presented last year at WMPP’01 [Walker01], we described the initial prototype of an associative processor implemented using field-programmable logic devices (FPLDs). ...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
We consider and analyze a new algorithm for balancing indivisible loads on a distributed network with n processors. The aim is minimizing the discrepancy between the maximum and m...