4516 search results - page 570 / 904 » Data Structures in the Design of Interfaces |
182
click to vote
BNCOD
2004
15 years 8 months ago
2004
The M-tree is a paged, dynamically balanced metric access method that responds gracefully to the insertion of new objects. Like many spatial access methods, the M-tree's perfo...
178
click to vote
DATESO
2004
15 years 8 months ago
2004
Large sparse matrices play important role in many modern information retrieval methods. These methods, such as clustering, latent semantic indexing, performs huge number of computa...
163
click to vote
GEOINFO
2004
15 years 8 months ago
2004
Abstract: This paper presents a data model for cyclic geographic events useful for nextgeneration geographic information system design. The paper introduces a structure that captur...
180
click to vote
SODA
2001
ACM
15 years 8 months ago
2001
ACM
Point location is the problem of preprocessing a planar polygonal subdivision S into a data structure in order to determine efficiently the cell of the subdivision that contains a...
180
click to vote
IJCAI
2003
15 years 8 months ago
2003
Information extraction from HTML pages has been conventionally treated as plain text documents extended with HTML tags. However, the growing maturity and correct usage of HTML/XHT...