Sciweavers

11212 search results - page 83 / 2243
» Semi-persistent Data Structures
Sort
View
110
Voted
COLING
2010
14 years 9 months ago
Self-Annotation for fine-grained geospatial relation extraction
A great deal of information on the Web is represented in both textual and structured form. The structured form is machinereadable and can be used to augment the textual data. We c...
André Blessing, Hinrich Schütze
129
Voted
MVA
2010
130views Computer Vision» more  MVA 2010»
15 years 20 days ago
Neighborhood linear embedding for intrinsic structure discovery
In this paper, an unsupervised learning algorithm, neighborhood linear embedding (NLE), is proposed to discover the intrinsic structures such as neighborhood relationships, global ...
Shuzhi Sam Ge, Feng Guan, Yaozhang Pan, Ai Poh Loh
105
Voted
DAGSTUHL
1998
15 years 3 months ago
Segmented Iterators and Hierarchical Algorithms
Abstract. Many data structures are naturally segmented. Generic algorithms that ignore that feature, and that treat every data structure as a uniform range of elements, are unneces...
Matthew H. Austern
112
Voted
CATA
2003
15 years 3 months ago
Visualizing Query Structure
Visualization research seeks to exploit the human user’s ability to interpret graphical representations of data in order to provide insight into properties of the data that may ...
Dennis P. Groth
JGTOOLS
2008
100views more  JGTOOLS 2008»
15 years 2 months ago
Proximity Cluster Trees
Hierarchical spatial data structures provide a means for organizing data for efficient processing. Most spatial data structures are optimized for performing queries, such as inters...
Elena Jakubiak Hutchinson, Sarah F. Frisken, Ronal...