Sciweavers

3444 search results - page 339 / 689
» A Theory of Object-Oriented Design
Sort
View
CHI
2004
ACM
16 years 7 months ago
Pointing without a pointer
We present a method for performing selection tasks based on continuous control of multiple, competing agents who try to determine the user's intentions from their control beh...
John Williamson, Roderick Murray-Smith
CHI
2003
ACM
16 years 7 months ago
Media inequality in conversation: how people behave differently when interacting with computers and people
How is interacting with computer programs different from interacting with people? One answer in the literature is that these two types of interactions are similar. The present stu...
Nicole Shechtman, Leonard M. Horowitz
STOC
2003
ACM
130views Algorithms» more  STOC 2003»
16 years 7 months ago
A tight bound on approximating arbitrary metrics by tree metrics
In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is O(log n). This ...
Jittat Fakcharoenphol, Satish Rao, Kunal Talwar
MOBIHOC
2007
ACM
16 years 6 months ago
Approximation algorithms for longest-lived directional multicast communications in WANETs
Several centralized and distributed algorithms have been recently proposed to maximize the multicast lifetime for directional communications in wireless ad-hoc networks. Their per...
Song Guo, Oliver W. W. Yang, Victor C. M. Leung
DCC
2006
IEEE
16 years 6 months ago
Uncoverings-by-bases for base-transitive permutation groups
An uncovering-by-bases for a group G acting on a finite set is a set U of bases for G such that any r-subset of is disjoint from at least one base in U, where r is a parameter d...
Robert F. Bailey