Sciweavers

967 search results - page 75 / 194
» Building a Calculus of Data Structures
Sort
View
VLDB
1995
ACM
121views Database» more  VLDB 1995»
15 years 6 months ago
Benchmarking Spatial Join Operations with Spatial Output
The spatial join operation is benchmarked using variants of well-known spatial data structures such as the R-tree, R-tree, R+-tree, and the PMR quadtree. The focus is on a spatia...
Erik G. Hoel, Hanan Samet
ICANN
2010
Springer
15 years 3 months ago
Visualising Clusters in Self-Organising Maps with Minimum Spanning Trees
Abstract. The Self-Organising Map (SOM) is a well-known neuralnetwork model that has successfully been used as a data analysis tool in many different domains. The SOM provides a to...
Rudolf Mayer, Andreas Rauber
VLDB
1997
ACM
94views Database» more  VLDB 1997»
15 years 6 months ago
To Weave the Web
The paper discusses the issue of views in the Web context. We introduce a set of languages for managing and restructuring data coming from the World Wide Web. We present a specifi...
Paolo Atzeni, Giansalvatore Mecca, Paolo Merialdo
114
Voted
ICDM
2007
IEEE
140views Data Mining» more  ICDM 2007»
15 years 8 months ago
Finding Cohesive Clusters for Analyzing Knowledge Communities
Documents and authors can be clustered into “knowledge communities” based on the overlap in the papers they cite. We introduce a new clustering algorithm, Streemer, which fin...
Vasileios Kandylas, S. Phineas Upham, Lyle H. Unga...
TLDI
2005
ACM
102views Formal Methods» more  TLDI 2005»
15 years 8 months ago
An open and shut typecase
Two different ways of defining ad-hoc polymorphic operations commonly occur in programming languages. With the first form polymorphic operations are defined inductively on the...
Dimitrios Vytiniotis, Geoffrey Washburn, Stephanie...