Sciweavers

948 search results - page 17 / 190
» What can we achieve by arbitrary announcements
Sort
View
HOTOS
1997
IEEE
13 years 11 months ago
What Synchronous Groupware Needs: Notification Services
Synchronous groupware is the class of applications in which two or more people collaborate in what they perceive to be real time. Most previous efforts to deploy synchronous group...
Mark Day
WEA
2005
Springer
120views Algorithms» more  WEA 2005»
14 years 1 months ago
Distilling Router Data Analysis for Faster and Simpler Dynamic IP Lookup Algorithms
Abstract. We consider the problem of fast IP address lookup in the forwarding engines of Internet routers. We analyze over 2400 public snapshots of routing tables collected over ...
Filippo Geraci, Roberto Grossi
ECCV
2008
Springer
14 years 9 months ago
Priors for Large Photo Collections and What They Reveal about Cameras
A large photo collection downloaded from the internet spans a wide range of scenes, cameras, and photographers. In this paper we introduce several novel priors for statistics of su...
Sujit Kuthirummal, Aseem Agarwala, Dan B. Goldman,...
TON
2008
59views more  TON 2008»
13 years 7 months ago
Throughput-optimal configuration of fixed wireless networks
In this paper, we address the following two questions concerning the capacity and configuration of fixed wireless networks: (i) given a set of wireless nodes with arbitrary but fix...
Aditya Karnik, Aravind Iyer, Catherine Rosenberg
VECPAR
2004
Springer
14 years 27 days ago
PerWiz: A What-If Prediction Tool for Tuning Message Passing Programs
Abstract. This paper presents PerWiz, a performance prediction tool for improving the performance of message passing programs. PerWiz focuses on locating where a significant impro...
Fumihiko Ino, Yuki Kanbe, Masao Okita, Kenichi Hag...