1191 search results - page 198 / 239 » Completeness and Performance Of The APO Algorithm |
134
Voted
STOC
2004
ACM
16 years 3 months ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
220
Voted
SIGMOD
2009
ACM
16 years 3 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...
107
click to vote
IROS
2008
IEEE
15 years 10 months ago
2008
IEEE
—This paper presents an alternative formulation for the Bayesian feature-based simultaneous localisation and mapping (SLAM) problem, using a random finite set approach. For a fe...
115
click to vote
IPPS
2007
IEEE
15 years 9 months ago
2007
IEEE
A heterogeneous multi-processor (HeMP) system consists of several heterogeneous processors, each of which is specially designed to deliver the best energy-saving performance for a...
134
click to vote
SAC
2005
ACM
15 years 9 months ago
2005
ACM
Peer-to-peer (P2P) has become an important computing model because of its adaptation, self-organization and autonomy etc. But efficient organization of the nodes in P2P networks i...