Sciweavers

1102 search results - page 155 / 221
» Distributed Key Generation for the Internet
Sort
View
SIGMETRICS
2004
ACM
115views Hardware» more  SIGMETRICS 2004»
15 years 8 months ago
Emulating low-priority transport at the application layer: a background transfer service
Low priority data transfer across the wide area is useful in several contexts, for example for the dissemination of large files such as OS updates, content distribution or prefet...
Peter B. Key, Laurent Massoulié, Bing Wang
AAAI
2006
15 years 4 months ago
A Compact Representation Scheme for Coalitional Games in Open Anonymous Environments
Coalition formation is an important capability of automated negotiation among self-interested agents. In order for coalitions to be stable, a key question that must be answered is...
Naoki Ohta, Atsushi Iwasaki, Makoto Yokoo, Kohki M...

Publication
116views
15 years 3 months ago
Poking Facebook: Characterization of OSN Applications
Facebook is one of the most popular Internet sites today. A key fea- ture that arguably contributed to Facebook's unprecedented success is its application platform, which enab...
Minas Gjoka, Michael Sirivianos, Athina Markopoulo...
ENTCS
2006
140views more  ENTCS 2006»
15 years 3 months ago
A Web Service Architecture for Enforcing Access Control Policies
Web services represent a challenge and an opportunity for organizations wishing to expose product and services offerings through the Internet. The Web service technology provides ...
Claudio Agostino Ardagna, Ernesto Damiani, Sabrina...
INFORMATICALT
2006
116views more  INFORMATICALT 2006»
15 years 3 months ago
An Agent-Based Best Effort Routing Technique for Load Balancing
Abstract. Several best effort schemes (next-hop routing) are used to transport the data in the Internet. Some of them do not perform flexible route computations to cope up with the...
Sunilkumar S. Manvi, Pallapa Venkataram