Sciweavers

547 search results - page 83 / 110
» Efficient Model Update for General Link-Insertion Networks
Sort
View
WWW
2001
ACM
15 years 10 months ago
Enabling full service surrogates using the portable channel representation
The simplicity of the basic client/server model of Web services led quickly to its widespread adoption, but also to scalability and performance problems. The technological respons...
Micah Beck, Terry Moore, Leif Abrahamsson, Christo...
EUROCRYPT
2004
Springer
15 years 1 months ago
Anonymous Identification in Ad Hoc Groups
We introduce Ad Hoc Anonymous Identification schemes, a new multi-user cryptographic primitive that allows participants from a user population to form ad hoc groups, and then prove...
Yevgeniy Dodis, Aggelos Kiayias, Antonio Nicolosi,...
KDD
2006
ACM
134views Data Mining» more  KDD 2006»
15 years 10 months ago
Learning to rank networked entities
Several algorithms have been proposed to learn to rank entities modeled as feature vectors, based on relevance feedback. However, these algorithms do not model network connections...
Alekh Agarwal, Soumen Chakrabarti, Sunny Aggarwal
STOC
2004
ACM
61views Algorithms» more  STOC 2004»
15 years 10 months ago
The zero-one principle for switching networks
Recently, approximation analysis has been extensively used to study algorithms for routing weighted packets in various network settings. Although different techniques were applied...
Yossi Azar, Yossi Richter
SIAMREV
2010
140views more  SIAMREV 2010»
14 years 4 months ago
What Shape Is Your Conjugate? A Survey of Computational Convex Analysis and Its Applications
Computational Convex Analysis algorithms have been rediscovered several times in the past by researchers from different fields. To further communications between practitioners, we ...
Yves Lucet