Sciweavers

2080 search results - page 382 / 416
» Measuring empirical computational complexity
Sort
View
STOC
1993
ACM
264views Algorithms» more  STOC 1993»
15 years 10 months ago
Contention in shared memory algorithms
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
Cynthia Dwork, Maurice Herlihy, Orli Waarts
ALT
2003
Springer
15 years 9 months ago
Efficiently Learning the Metric with Side-Information
Abstract. A crucial problem in machine learning is to choose an appropriate representation of data, in a way that emphasizes the relations we are interested in. In many cases this ...
Tijl De Bie, Michinari Momma, Nello Cristianini
CIKM
2008
Springer
15 years 8 months ago
Mining social networks using heat diffusion processes for marketing candidates selection
Social Network Marketing techniques employ pre-existing social networks to increase brands or products awareness through word-of-mouth promotion. Full understanding of social netw...
Hao Ma, Haixuan Yang, Michael R. Lyu, Irwin King
ICFP
2010
ACM
15 years 7 months ago
Distance makes the types grow stronger: a calculus for differential privacy
We want assurances that sensitive information will not be disclosed when aggregate data derived from a database is published. Differential privacy offers a strong statistical guar...
Jason Reed, Benjamin C. Pierce
AMC
2010
175views more  AMC 2010»
15 years 6 months ago
An inexact parallel splitting augmented Lagrangian method for large system of linear equations
: Parallel iterative methods are powerful tool for solving large system of linear equations (LEs). The existing parallel computing research results are focussed mainly on sparse sy...
Zheng Peng, DongHua Wu