Sciweavers

921 search results - page 108 / 185
» New Data Structures for Orthogonal Range Searching
Sort
View
CIDR
2003
147views Algorithms» more  CIDR 2003»
15 years 5 months ago
Sorting And Indexing With Partitioned B-Trees
Partitioning within a B-tree, based on an artificial leading key column and combined with online reorganization, can be exploited during external merge sort for accurate deep read...
Goetz Graefe
WWW
2008
ACM
16 years 5 months ago
Extracting XML schema from multiple implicit xml documents based on inductive reasoning
We propose a method of classifying XML documents and extracting XML schema from XML by inductive inference based on constraint logic programming. The goal of this work is to type ...
Masaya Eki, Tadachika Ozono, Toramatsu Shintani
AAAI
2008
15 years 6 months ago
Efficient Querying Relaxed Dominant Relationship between Product Items Based on Rank Aggregation
Current search engines cannot effectively rank those relational data, which exists on dynamic websites supported by online databases. In this study, to rank such structured data, ...
Zhenglu Yang, Lin Li, Masaru Kitsuregawa
SG
2009
Springer
15 years 11 months ago
Feature-Driven Volume Fairing
Abstract. Volume datasets have been a primary representation for scientific visualization with the advent of rendering algorithms such as marching cubes and ray casting. Nonethele...
Shigeo Takahashi, Jun Kobayashi, Issei Fujishiro
ESOP
2006
Springer
15 years 8 months ago
Pure Pattern Calculus
Abstract. The pure pattern calculus generalises the pure lambda-calculus by basing computation on pattern-matching instead of beta-reduction. The simplicity and power of the calcul...
C. Barry Jay, Delia Kesner