Sciweavers

1322 search results - page 165 / 265
» Efficient Goal-Directed Exploration
Sort
View
142
Voted
WWW
2008
ACM
16 years 4 months ago
Offline matching approximation algorithms in exchange markets
Motivated by several marketplace applications on rapidly growing online social networks, we study the problem of efficient offline matching algorithms for online exchange markets....
Zeinab Abbassi, Laks V. S. Lakshmanan
WWW
2007
ACM
16 years 4 months ago
Utility analysis for topically biased PageRank
PageRank is known to be an efficient metric for computing general document importance in the Web. While commonly used as a one-size-fits-all measure, the ability to produce topica...
Christian Kohlschütter, Paul-Alexandru Chirit...
WWW
2003
ACM
16 years 4 months ago
Application specific data replication for edge services
The emerging edge services architecture promises to improve the availability and performance of web services by replicating servers at geographically distributed sites. A key chal...
Lei Gao, Michael Dahlin, Amol Nayate, Jiandan Zhen...
CHES
2009
Springer
230views Cryptology» more  CHES 2009»
16 years 4 months ago
Designing an ASIP for Cryptographic Pairings over Barreto-Naehrig Curves
Abstract. This paper presents a design-space exploration of an applicationspecific instruction-set processor (ASIP) for the computation of various cryptographic pairings over Barre...
David Kammler, Diandian Zhang, Dominik Auras, Gerd...
KDD
2008
ACM
140views Data Mining» more  KDD 2008»
16 years 4 months ago
On updates that constrain the features' connections during learning
In many multiclass learning scenarios, the number of classes is relatively large (thousands,...), or the space and time efficiency of the learning system can be crucial. We invest...
Omid Madani, Jian Huang 0002