Sciweavers

137 search results - page 18 / 28
» Cross-Serial Dependencies Are Not Hard to Process
Sort
View
CHI
2001
ACM
15 years 9 months ago
Responding to subtle, fleeting changes in the user's internal state
In human-to-human interaction, people sometimes are able to pick up and respond sensitively to the other's internal state as it shifts moment by moment over the course of an ...
Wataru Tsukahara, Nigel Ward
STOC
2007
ACM
100views Algorithms» more  STOC 2007»
15 years 9 months ago
Reordering buffers for general metric spaces
In the reordering buffer problem, we are given an input sequence of requests for service each of which corresponds to a point in a metric space. The cost of serving the requests h...
Matthias Englert, Harald Räcke, Matthias West...
PODS
2008
ACM
159views Database» more  PODS 2008»
15 years 9 months ago
Approximation algorithms for clustering uncertain data
There is an increasing quantity of data with uncertainty arising from applications such as sensor network measurements, record linkage, and as output of mining algorithms. This un...
Graham Cormode, Andrew McGregor
74
Voted
MOBISYS
2006
ACM
15 years 9 months ago
Context-aware interactive content adaptation
Automatic adaptation of content for mobile devices is a challenging problem because optimal adaptation often depends on the usage semantics of content, as well as the context of u...
Iqbal Mohomed, Jim Chengming Cai, Sina Chavoshi, E...
MOBIHOC
2002
ACM
15 years 9 months ago
On the minimum node degree and connectivity of a wireless multihop network
This paper investigates two fundamental characteristics of a wireless multihop network: its minimum node degree and its k?connectivity. Both topology attributes depend on the spat...
Christian Bettstetter