Sciweavers

13214 search results - page 2349 / 2643
» Pseudorandomness for network algorithms
Sort
View
INFOCOM
2006
IEEE
16 years 24 days ago
Minimum User-Perceived Interference Routing in Service Composition
— Service Composition is a promising technology for providing on-demand services in dynamic and loosely coupled peerto-peer (P2P) networks. Because of system dynamics, such as th...
Li Xiao, Klara Nahrstedt
NETGAMES
2006
ACM
16 years 21 days ago
Applicability of group communication for increased scalability in MMOGs
Massive multiplayer online games (MMOGs) are today the driving factor for the development of distributed interactive applications, and they are increasing in size and complexity. ...
Knut-Helge Vik, Carsten Griwodz, Pål Halvors...
PODC
2006
ACM
16 years 21 days ago
Sketching asynchronous streams over a sliding window
We study the problem of maintaining sketches of recent elements of a data stream. Motivated by applications involving network data, we consider streams that are asynchronous, in w...
Srikanta Tirthapura, Bojian Xu, Costas Busch
SIGIR
2006
ACM
16 years 21 days ago
You are what you say: privacy risks of public mentions
In today’s data-rich networked world, people express many aspects of their lives online. It is common to segregate different aspects in different places: you might write opinion...
Dan Frankowski, Dan Cosley, Shilad Sen, Loren G. T...
AINA
2005
IEEE
16 years 11 days ago
iHITS: Extending HITS for Personal Interests Profiling
Ever since the boom of World Wide Web, profiling online users' interests has become an important task for content providers. The traditional approach involves manual entry of...
Ziming Zhuang
« Prev « First page 2349 / 2643 Last » Next »