948 search results - page 61 / 190 » What can we achieve by arbitrary announcements |
DEXA
2008
Springer
13 years 9 months ago
2008
Springer
The query performance for tracing tags depends upon the distribution of tag trajectories in the data space. We examine a more efficient representation of tag trajectories by means ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
By combining the features of CSMA and TDMA, fully decentralised WLAN MAC schemes have recently been proposed that converge to collision-free schedules. In this paper we describe a ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Abstract--We give sublinear-time approximation algorithms for some optimization problems arising in machine learning, such as training linear classifiers and finding minimum enclos...
ALGORITHMICA
1998
13 years 7 months ago
1998
We consider the problem of dynamic reorganization of a linear list, where requests for the elements are generated randomly with fixed, unknown probabilities. The objective is to ...
LPAR
2004
Springer
14 years 1 months ago
2004
Springer
We propose a new parameter for the complexity of finite directed graphs which measures to what extent the cycles of the graph are intertwined. This measure, called entanglement, i...