5169 search results - page 154 / 1034 » Locality approximation using time |
118
Voted
STACS
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We consider data structures and algorithms for preprocessing a labelled list of length n so that, for any given indices i and j we can answer queries of the form: What is...
129
click to vote
ICRA
2010
IEEE
15 years 3 months ago
2010
IEEE
— We present here an original approach to test the feasibility of footsteps for a given walking pattern generator. It is based on a new approximation algorithm intended to cope w...
154
click to vote
KDD
2009
ACM
16 years 5 months ago
2009
ACM
We propose two approximation algorithms for identifying communities in dynamic social networks. Communities are intuitively characterized as "unusually densely knit" sub...
135
click to vote
STOC
2002
ACM
16 years 5 months ago
2002
ACM
Given a set S of n points in IRd , a (t, )-approximate Voronoi diagram (AVD) is a partition of space into constant complexity cells, where each cell c is associated with t represe...
135
click to vote
ICC
2007
IEEE
15 years 11 months ago
2007
IEEE
—In this paper we consider the localization of a mobile station (MS) in time division multiple access (TDMA) based communication systems. We use joint angle and delay measurement...