1396 search results - page 248 / 280 » Succinct Dynamic Data Structures |
CCCG
1993
13 years 9 months ago
1993
A k-dense corridor through a finite set, S, of n points in the plane is the open region of the plane that is bounded by two parallel lines that intersect the convex hull of S and ...
COLING
1996
13 years 9 months ago
1996
This paper snggests a method to align Korean-English parallel corpus. '1?he structural dissimilarity between Korean and Indo-European languages requires more flexible measure...
VMV
2007
13 years 9 months ago
2007
In this paper we present an efficient data structure and algorithms for GPU ray tracing of secondary effects like reflections, refractions and shadows. Our method extends previo...
DEXA
2010
Springer
13 years 8 months ago
2010
Springer
Given a spatio-temporal network (ST network) whose edge properties vary with time, a time-sub-interval minimum spanning tree (TSMST) is a collection of distinct minimum spanning t...
COMCOM
2010
13 years 8 months ago
2010
For data-collection applications in sensor networks, it is important to ensure base station receives a complete picture about the monitored area. Convergecast is an important commu...