Sciweavers

2612 search results - page 509 / 523
» Assemblies as Graph Processes
Sort
View
COOPIS
2004
IEEE
13 years 11 months ago
Composing Mappings Between Schemas Using a Reference Ontology
Large-scale database integration requires a significant cost in developing a global schema and finding mappings between the global and local schemas. Developing the global schema r...
Eduard C. Dragut, Ramon Lawrence
CIKM
2006
Springer
13 years 11 months ago
TRIPS and TIDES: new algorithms for tree mining
Recent research in data mining has progressed from mining frequent itemsets to more general and structured patterns like trees and graphs. In this paper, we address the problem of...
Shirish Tatikonda, Srinivasan Parthasarathy, Tahsi...
COMPGEOM
2006
ACM
13 years 11 months ago
I/O-efficient batched union-find and its applications to terrain analysis
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...
Pankaj K. Agarwal, Lars Arge, Ke Yi
KDD
2000
ACM
222views Data Mining» more  KDD 2000»
13 years 11 months ago
Interactive exploration of very large relational datasets through 3D dynamic projections
The grand tour, one of the most popular methods for multidimensional data exploration, is based on orthogonally projecting multidimensional data to a sequence of lower dimensional...
Li Yang
AIPS
2008
13 years 10 months ago
Learning Relational Decision Trees for Guiding Heuristic Planning
The current evaluation functions for heuristic planning are expensive to compute. In numerous domains these functions give good guidance on the solution, so it worths the computat...
Tomás de la Rosa, Sergio Jiménez, Da...