2104 search results - page 353 / 421 » Sorting with networks of data structures |
141
click to vote
COMPGEOM
2004
ACM
15 years 10 months ago
2004
ACM
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...
143
click to vote
EDBTW
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. The rapid increase on the circulation of data over the web has highlighted the need for distributed storage of Internet-accessible information due to the rapid increase o...
131
click to vote
ICDM
2003
IEEE
15 years 9 months ago
2003
IEEE
Tree structures are used extensively in domains such as computational biology, pattern recognition, computer networks, and so on. In this paper, we present an indexing technique f...
137
click to vote
INFOVIS
2003
IEEE
15 years 9 months ago
2003
IEEE
An increasing number of tasks require people to explore, navigate and search extremely complex data sets visualized as graphs. Examples include electrical and telecommunication ne...
160
click to vote
DIM
2007
ACM
15 years 8 months ago
2007
ACM
In this paper, we examine how conclusions about linkability threats can be drawn by analyzing message contents and subject knowledge in arbitrary communication systems. At first, ...