3071 search results - page 265 / 615 » Explanatory Design Theory |
185
click to vote
STOC
2003
ACM
16 years 7 months ago
2003
ACM
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 ...
193
click to vote
MOBIHOC
2007
ACM
16 years 6 months ago
2007
ACM
Several centralized and distributed algorithms have been recently proposed to maximize the multicast lifetime for directional communications in wireless ad-hoc networks. Their per...
188
click to vote
DCC
2006
IEEE
16 years 6 months ago
2006
IEEE
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...
191
click to vote
WISEC
2010
ACM
16 years 1 months ago
2010
ACM
As privacy moves to the center of attention in networked systems, and the need for trust remains a necessity, an important question arises: How do we reconcile the two seemingly c...
198
click to vote
HRI
2009
ACM
16 years 1 months ago
2009
ACM
The Wizard of Oz experiment method has a long tradition of acceptance and use within the field of human-robot interaction. The community has traditionally downplayed the importanc...