Results 1  10
of
122
There Goes the Neighborhood: Relational Algebra for Spatial Data Search”, Microsoft
, 2004
"... 2. Working in 3D Avoids Spherical Geometry_________________________________________ _ 2 ..."
Abstract

Cited by 7 (4 self)
 Add to MetaCart
2. Working in 3D Avoids Spherical Geometry_________________________________________ _ 2
Relational Algebra for Spatial Data Search
, 2004
"... We explored ways of doing spatial search within a relational database: (1) hierarchical triangular mesh (a tessellation of the sphere), (2) a zoned bucketing system, and (3) representing areas as disjunctivenormal form constraints. Each of these approaches has merits. They all allow efficient point ..."
Abstract
 Add to MetaCart
We explored ways of doing spatial search within a relational database: (1) hierarchical triangular mesh (a tessellation of the sphere), (2) a zoned bucketing system, and (3) representing areas as disjunctivenormal form constraints. Each of these approaches has merits. They all allow efficient
Coil sensitivity encoding for fast MRI. In:
 Proceedings of the ISMRM 6th Annual Meeting,
, 1998
"... New theoretical and practical concepts are presented for considerably enhancing the performance of magnetic resonance imaging (MRI) by means of arrays of multiple receiver coils. Sensitivity encoding (SENSE) is based on the fact that receiver sensitivity generally has an encoding effect complementa ..."
Abstract

Cited by 193 (3 self)
 Add to MetaCart
reconstruction from multiple receiver data. Using the framework of linear algebra, two different reconstruction strategies have been derived. In their general forms the resulting formulae hold for arbitrary sampling patterns in kspace. A detailed discussion is dedicated to the most practical case, namely
Direct inversion of spatial autocorrelation curves with the neighborhood algorithm
, 2005
"... Abstract Ambient vibration techniques are promising methods for assessing the subsurface structure, in particular the shearwave velocity profile (Vs). They are based on the dispersion property of surface waves in layered media. Therefore, the penetration depth is intrinsically linked to the energy ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
, the spatial autocorrelation is mathematically related to the frequencydependent wave velocity c(x). This allows the determination of the dispersion curve of traveling surface waves, which, in turn, is linked to the Vs profile. Here, we propose a direct inversion scheme for the observed autocorrelation curves
Efficient Utilization of DBMS Potential in Spatial Data Mining Applications  Neighborhood Relation Modeling Approach
, 2012
"... In the core concept of spatial data mining we need to investigate the neighbors of many objects in the single run of typical data mining algorithm. This means that in spatial data mining algorithm we have to efficiently process the neighborhood relations. An integration of spatial data mining algori ..."
Abstract
 Add to MetaCart
In the core concept of spatial data mining we need to investigate the neighbors of many objects in the single run of typical data mining algorithm. This means that in spatial data mining algorithm we have to efficiently process the neighborhood relations. An integration of spatial data mining
Spatial Data Mining: Database Primitives, Algorithms and Efficient DBMS Support
 IN PROC.OFINT.CONF.ON DATABASES IN OFFICE, ENGINEERING AND SCIENCE
, 1999
"... Spatial data mining algorithms heavily depend on the efficient processing of neighborhood relations since the neighbors of many objects have to be investigated in a single run of a typical algorithm. Therefore, providing general concepts for neighborhood relations as well as an efficient implementat ..."
Abstract

Cited by 32 (1 self)
 Add to MetaCart
Spatial data mining algorithms heavily depend on the efficient processing of neighborhood relations since the neighbors of many objects have to be investigated in a single run of a typical algorithm. Therefore, providing general concepts for neighborhood relations as well as an efficient
A Framework for Spatial Data Mining
, 2012
"... Our framework for spatial data mining heavily depend on the efficient processing of neighborhood relations since the neighbors of many objects have to be investigated in a single run of a typical algorithm. Therefore, providing general concepts for neighborhood relations as well as an efficient im ..."
Abstract
 Add to MetaCart
Our framework for spatial data mining heavily depend on the efficient processing of neighborhood relations since the neighbors of many objects have to be investigated in a single run of a typical algorithm. Therefore, providing general concepts for neighborhood relations as well as an efficient
Materials for an exploratory theory of the network society.
 The British Journal of Sociology
, 2000
"... ABSTRACT This article aims at proposing some elements for a grounded theor y of the network society. The network society is the social structure characteristic of the Information Age, as tentatively identi ed by empirical, crosscultural investigation. It permeates most societies in the world, in v ..."
Abstract

Cited by 122 (0 self)
 Add to MetaCart
of labour, reversing the process of socialization of production characteristic of the industrial era, still at the roots of our current system of industrial relations. The work process is interconnected between rms, regions, and countries, in a stepped up spatial division of labour, in which networks
Graphsatatime: Query Language and Access Methods for Graph Databases
, 2008
"... With the prevalence of graph data in a variety of domains, there is an increasing need for a language to query and manipulate graphs with heterogeneous attributes and structures. We propose a query language for graph databases that supports arbitrary attributes on nodes, edges, and graphs. In this l ..."
Abstract

Cited by 70 (0 self)
 Add to MetaCart
. In this language, graphs are the basic unit of information and each query manipulates one or more collections of graphs. To allow for flexible compositions of graph structures, we extend the notion of formal languages from strings to the graph domain. We present a graph algebra extended from the relational algebra
Results 1  10
of
122