11211 search results - page 262 / 2243 » Rank-Sensitive Data Structures |
223
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
In this paper we describe a new efficient (in fact optimal) data structure for the top-K color problem. Each element of an array A is assigned a color c with priority p(c). For a ...
272
click to vote
COMPGEOM
2011
ACM
14 years 10 months ago
2011
ACM
We present three results related to dynamic convex hulls: • A fully dynamic data structure for maintaining a set of n points in the plane so that we can find the edges of the c...
193
click to vote
INFOCOM
2011
IEEE
14 years 10 months ago
2011
IEEE
—An approximate distance query data structure is a compact representation of a graph, and can be queried to approximate shortest paths between any pair of vertices. Any such data...
196
click to vote
JAIR
2008
15 years 6 months ago
2008
In order for agents to act on behalf of users, they will have to retrieve and integrate vast amounts of textual data on the World Wide Web. However, much of the useful data on the...
169
click to vote
CPM
1999
Springer
15 years 10 months ago
1999
Springer
We present a very efficient, in terms of space and access speed, data structure for storing huge natural language data sets. The structure is described as LZ (Ziv Lempel) compresse...