Sciweavers

334 search results - page 56 / 67
» Efficient Algorithms for the Tree Homeomorphism Problem
Sort
View
TKDE
2008
112views more  TKDE 2008»
14 years 9 months ago
IDD: A Supervised Interval Distance-Based Method for Discretization
This paper introduces a new method for supervised discretization based on interval distances by using a novel concept of neighborhood in the target's space. The proposed metho...
Francisco J. Ruiz, Cecilio Angulo, Núria Ag...
DASFAA
2006
IEEE
152views Database» more  DASFAA 2006»
15 years 3 months ago
Effective Keyword Search in XML Documents Based on MIU
Keyword search is an effective approach for most users to search for information because they do not need to learn complex query languages or the underlying structures of the data....
Jianjun Xu, Jiaheng Lu, Wei Wang 0009, Baile Shi
VISUALIZATION
1996
IEEE
15 years 1 months ago
Hierarchical and Parallelizable Direct Volume Rendering for Irregular and Multiple Grids
A general volume rendering technique is described that efficiently produces images of excellent quality from data defined over irregular grids having a wide variety of formats. Re...
Jane Wilhelms, Allen Van Gelder, Paul Tarantino, J...
CPM
2006
Springer
182views Combinatorics» more  CPM 2006»
15 years 1 months ago
Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
The Range-Minimum-Query-Problem is to preprocess an array such that the position of the minimum element between two specified indices can be obtained efficiently. We present a dire...
Johannes Fischer, Volker Heun
EDBT
2000
ACM
15 years 1 months ago
Mining Classification Rules from Datasets with Large Number of Many-Valued Attributes
Decision tree induction algorithms scale well to large datasets for their univariate and divide-and-conquer approach. However, they may fail in discovering effective knowledge when...
Giovanni Giuffrida, Wesley W. Chu, Dominique M. Ha...