Sciweavers

568 search results - page 7 / 114
» Indexing Large Human-Motion Databases
Sort
View
CIKM
2010
Springer
13 years 6 months ago
A hierarchical approach to reachability query answering in very large graph databases
The cost of reachability query computation using traditional algorithms such as depth first search or transitive closure has been found to be prohibitive and unacceptable in mass...
Saikat K. Dey, Hasan M. Jamil
CA
2002
IEEE
14 years 14 days ago
AMOBA: A Database System for Annotating Captured Human Movements
For the management of a large number of motion data for humanoid virtual actors we propose to use a database system to store and retrieve motion data with additional information. ...
Stefan Grünvogel, Jens Piesk, Stephan Schwich...
DATAMINE
1999
113views more  DATAMINE 1999»
13 years 7 months ago
A Fast Parallel Clustering Algorithm for Large Spatial Databases
The clustering algorithm DBSCAN relies on a density-based notion of clusters and is designed to discover clusters of arbitrary shape as well as to distinguish noise. In this paper,...
Xiaowei Xu, Jochen Jäger, Hans-Peter Kriegel
PVLDB
2010
200views more  PVLDB 2010»
13 years 5 months ago
SAPPER: Subgraph Indexing and Approximate Matching in Large Graphs
With the emergence of new applications, e.g., computational biology, new software engineering techniques, social networks, etc., more data is in the form of graphs. Locating occur...
Shijie Zhang, Jiong Yang, Wei Jin
ICDE
2007
IEEE
164views Database» more  ICDE 2007»
14 years 1 months ago
An Integer Linear Programming Approach to Database Design
Existing index selection tools rely on heuristics to efficiently search within the large space of alternative solutions and to minimize the overhead of using the query optimizer ...
Stratos Papadomanolakis, Anastassia Ailamaki