921 search results - page 104 / 185 » New Data Structures for Orthogonal Range Searching |
181
click to vote
CORR
2010
Springer
14 years 11 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 ...
153
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
We propose new succinct representations of ordinal trees, which have been studied extensively. It is known that any n-node static tree can be represented in 2n + o(n) bits and a l...
148
click to vote
DIS
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. One of the main goals of Discovery Science is the development and analysis of methods for automatic knowledge discovery in the natural sciences. A central area of natural...
137
click to vote
WWW
2008
ACM
16 years 5 months ago
2008
ACM
In this paper, we formally define the problem of topic modeling with network structure (TMN). We propose a novel solution to this problem, which regularizes a statistical topic mo...
152
click to vote
MOBICOM
2000
ACM
15 years 8 months ago
2000
ACM
An on-demand routing protocol for wireless ad hoc networks is one that searches for and attempts to discover a route to some destination node only when a sending node originates a...