11784 search results - page 101 / 2357 » Interpolation for data structures |
KDD
2003
ACM
15 years 11 months ago
2003
ACM
Using visualization techniques to explore and understand high-dimensional data is an efficient way to combine human intelligence with the immense brute force computation power ava...
104
click to vote
CAISE
2001
Springer
15 years 3 months ago
2001
Springer
XML is fast becoming the standard for information exchange on the Internet. As such, information expressed in XML will need to be integrated with existing information systems, whi...
GBRPR
2009
Springer
15 years 3 months ago
2009
Springer
This paper proposes to transform data scanned randomly in a well-defined space (e.g, Euclidean) along a hierarchical irregular pyramidal structure in an attempt reduce search time...
CG
2007
Springer
14 years 11 months ago
2007
Springer
The winged- and half- edge data structures are commonly used representations for polyhedron models. Due to the complexity, students in an introductory to computer graphics course ...
ML
2007
ACM
14 years 10 months ago
2007
ACM
The problem of disjoint sets, also known as union-find, consists in maintaining a partition of a finite set within a data structure. This structure provides two operations: a fu...