948 search results - page 43 / 190 » What can we achieve by arbitrary announcements |
SAMOS
2010
Springer
13 years 6 months ago
2010
Springer
—Memory bandwidth has always been a critical factor for the performance of many data intensive applications. The increasing processor performance, and the advert of single chip m...
VR
2003
IEEE
14 years 27 days ago
2003
IEEE
We present a demonstrated and commercially viable self-tracker, using robust software that fuses data from inertial and vision sensors. Compared to infrastructurebased trackers, s...
DIM
2007
ACM
13 years 11 months ago
2007
ACM
In this paper, we examine how conclusions about linkability threats can be drawn by analyzing message contents and subject knowledge in arbitrary communication systems. At first, ...
IPL
2010
13 years 6 months ago
2010
In this paper, we look at the time complexity of two agreement problems in networks of oblivious mobile robots, namely, at the gathering and scattering problems. Given a set of ro...
ICDM
2006
IEEE
14 years 1 months ago
2006
IEEE
Mining graph databases for frequent subgraphs has recently developed into an area of intensive research. Its main goals are to reduce the execution time of the existing basic algo...