Sciweavers

8080 search results - page 1177 / 1616
» From Computer Networks to Agent Networks
Sort
View
IPTPS
2003
Springer
16 years 22 hour ago
Adaptive Peer Selection
In a peer-to-peer file-sharing system, a client desiring a particular file must choose a source from which to download. The problem of selecting a good data source is difficult...
Daniel S. Bernstein, Zhengzhu Feng, Brian Neil Lev...
WMTE
2002
IEEE
15 years 11 months ago
Environmental Detectives: PDAs as a Window into a Virtual Simulated World
The use of computer simulations is changing the nature of scientific investigation and providing us unique insights into the way that the world works. As simulation moves from the...
Eric Klopfer, Kurt Squire, Henry Jenkins
MM
2000
ACM
99views Multimedia» more  MM 2000»
15 years 11 months ago
A generic late-join service for distributed interactive media
In this paper we present a generic late-join service for distributed interactive media, i.e., networked media which involve user interactions. Examples for distributed interactive...
Jürgen Vogel, Martin Mauve, Werner Geyer, Vol...
KDD
2010
ACM
250views Data Mining» more  KDD 2010»
15 years 10 months ago
Modeling relational events via latent classes
Many social networks can be characterized by a sequence of dyadic interactions between individuals. Techniques for analyzing such events are of increasing interest. In this paper,...
Christopher DuBois, Padhraic Smyth
186
Voted
ESA
2000
Springer
104views Algorithms» more  ESA 2000»
15 years 10 months ago
Efficient Algorithms for Centers and Medians in Interval and Circular-Arc Graphs
The p-center problem is to locate p facilities on a network so as to minimize the largest distance from a demand point to its nearest facility. The p-median problem is to locate p ...
Sergei Bespamyatnikh, Binay K. Bhattacharya, J. Ma...
« Prev « First page 1177 / 1616 Last » Next »