2498 search results - page 77 / 500 » Data Structures with Unpredictable Timing |
KDD
2006
ACM
15 years 10 months ago
2006
ACM
This paper presents an LDA-style topic model that captures not only the low-dimensional structure of data, but also how the structure changes over time. Unlike other recent work t...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
A data structure, called a biased range tree, is presented that preprocesses a set S of n points in R2 and a query distribution D for 2-sided orthogonal range counting queries. The...
CORR
2011
Springer
14 years 1 months ago
2011
Springer
Motivated by the desire to cope with data imprecision [8], we study methods for preprocessing a set of planar regions such that whenever we are given a set of points, each of whic...
VTC
2010
IEEE
14 years 8 months ago
2010
IEEE
—This paper proposes a new wireless scheduling methodology which takes advantage of future predictions of data rate for the several users competing for physical access. Based on ...
ECSQARU
1997
Springer
15 years 2 months ago
1997
Springer
Abstract. Temporal programming languages are recognized as natural and expressive formalisms for describing dynamic systems. However, most such languages are based on linear ow of ...