6650 search results - page 1182 / 1330 » models 2009 |
165
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
Abstract. We study the problem of maintaining a dynamic tree succinctly, in 2n + o(n) bits, under updates of the following form: insertion or deletion of a leaf, insertion of a nod...
176
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
Traditionally, combinatorial optimization problems (such as maximum flow, maximum matching, etc.) have been studied for networks where each link has a fixed capacity. Recent resear...
252
click to vote
SIGMOD
2009
ACM
16 years 6 months ago
2009
ACM
We present a complete XPath cost-based optimization and execution framework and demonstrate its effectiveness and efficiency for a variety of queries and datasets. The framework i...
176
click to vote
SOSP
2009
ACM
16 years 2 months ago
2009
ACM
This paper addresses the problem of scheduling concurrent jobs on clusters where application data is stored on the computing nodes. This setting, in which scheduling computations ...
142
click to vote
HRI
2009
ACM
16 years 20 days ago
2009
ACM
Providing route directions is a complicated interaction. Utterances are combined with gestures and pronounced with appropriate timing. This study proposes a model for a robot that...