4926 search results - page 254 / 986 » Two Graph Algorithms On an Associative Computing Model |
148
click to vote
ATAL
2007
Springer
16 years 16 days ago
2007
Springer
Agents engaged in noncooperative interaction may seek to achieve a Nash equilibrium; this requires that agents be aware of others’ rewards. Misinformation about rewards leads to...
179
click to vote
HIPC
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Lock-free shared data structures in the setting of distributed computing have received a fair amount of attention. Major motivations of lock-free data structures include ...
184
click to vote
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
An expert finding system allows a user to type a simple text query and retrieve names and contact information of individuals that possess the expertise expressed in the query. Thi...
169
click to vote
VLDB
1991
ACM
15 years 9 months ago
1991
ACM
Shared nothing multiprocessor archit.ecture is known t.obe more scalable to support very large databases. Compared to other join strategies, a hash-ba9ed join algorithm is particu...
176
Voted
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
Recent work has shown that one can learn the structure of Gaussian Graphical Models by imposing an L1 penalty on the precision matrix, and then using efficient convex optimization...