Sciweavers

2292 search results - page 240 / 459
» A Data Model and Data Structures for Moving Objects Database...
Sort
View
VRCAI
2006
ACM
14 years 2 months ago
Kinetic bounding volume hierarchies for deformable objects
We present novel algorithms for updating bounding volume hierarchies of objects undergoing arbitrary deformations. Therefore, we introduce two new data structures, the kinetic AAB...
Gabriel Zachmann, Rene Weller
ICDM
2009
IEEE
112views Data Mining» more  ICDM 2009»
14 years 2 months ago
Resolving Identity Uncertainty with Learned Random Walks
A pervasive problem in large relational databases is identity uncertainty which occurs when multiple entries in a database refer to the same underlying entity in the world. Relati...
Ted Sandler, Lyle H. Ungar, Koby Crammer
IEEEMM
2002
134views more  IEEEMM 2002»
13 years 8 months ago
A Middleware Architecture for Open and Interoperable GISs
an abstract model for information sharing and integration and use it to develop an architecture for building open, component-based, interoperable systems. A geographic information ...
Steven H. Wong, Steven L. Swartz, Dilip Sarkar
IDEAS
2000
IEEE
96views Database» more  IDEAS 2000»
14 years 17 days ago
A Cost Function for Uniformly Partitioned UB-Trees
Most operations of the relational algebra or SQL - like projection with duplicate elimination, join, ordering, group by and aggregations - are efficiently processed using a sorted...
Volker Markl, Rudolf Bayer
BMCBI
2010
149views more  BMCBI 2010»
13 years 8 months ago
KID - an algorithm for fast and efficient text mining used to automatically generate a database containing kinetic information o
Background: The amount of available biological information is rapidly increasing and the focus of biological research has moved from single components to networks and even larger ...
Stephanie Heinen, Bernhard Thielen, Dietmar Schomb...