Sciweavers

1487 search results - page 103 / 298
» The Computational Complexity of Link Building
Sort
View
108
Voted
ACMSE
2006
ACM
15 years 10 months ago
Evaluation of a location-linked notes system
We present a location-aware messaging system that lets users read and post notes linked to a particular location. We developed multiple clients (designed to run on desktop compute...
Manas Tungare, Ingrid Burbey, Manuel A. Pér...
CHI
1997
ACM
15 years 8 months ago
Rosebud: Technological Toys for Storytelling
Rosebud is a user-interface prototype which elicits storytelling by child users though interaction with a computationally-augmented physical artifact. In particular, Rosebud links...
Jennifer W. Glos, Justine Cassell
ANOR
2010
112views more  ANOR 2010»
15 years 4 months ago
The Multi-Story Space Assignment Problem
-- The Multi-Story Space Assignment Problem (MSAP) is an innovative formulation of the multi-story facility assignment problem that allows one to model the location of departments ...
Peter M. Hahn, J. MacGregor Smith, Yi-Rong Zhu
DEBS
2008
ACM
15 years 5 months ago
Availability models for underlay aware overlay networks
Availability of an overlay network is a necessary condition for event delivery in event based systems. The availability of the overlay links depends on the underlying physical net...
Madhu Kumar SD, Umesh Bellur
113
Voted
CLUSTER
2000
IEEE
15 years 4 months ago
Dynamic Max-Min fairness in ring networks
Ring networks are enjoying renewed interest as Storage Area Networks (SANs), i.e., networks for interconnecting storage devices (e.g., disk, disk arrays and tape drives) and stora...
Giuseppe Anastasi, Luciano Lenzini, M. La Porta, Y...