Sciweavers

2260 search results - page 415 / 452
» A new algorithm for clustering search results
Sort
View
ISPD
1999
ACM
112views Hardware» more  ISPD 1999»
15 years 4 months ago
Arbitrary convex and concave rectilinear block packing using sequence-pair
The sequence-pair was proposed in 1994 as a representation of the packing of rectangles of general structure. Since then, there have been e orts to expand its applicability over s...
Kunihiro Fujiyoshi, Hiroshi Murata
RSFDGRC
1999
Springer
194views Data Mining» more  RSFDGRC 1999»
15 years 4 months ago
A Closest Fit Approach to Missing Attribute VAlues in Preterm Birth Data
: In real-life data, in general, many attribute values are missing. Therefore, rule induction requires preprocessing, where missing attribute values are replaced by appropriate val...
Jerzy W. Grzymala-Busse, Witold J. Grzymala-Busse,...
VLDB
1994
ACM
129views Database» more  VLDB 1994»
15 years 3 months ago
Hilbert R-tree: An Improved R-tree using Fractals
We propose a new R-tree structure that outperforms all the older ones. The heart of the idea is to facilitate the deferred splitting approach in R-trees. This is done by proposing...
Ibrahim Kamel, Christos Faloutsos
AIED
2007
Springer
15 years 3 months ago
Optimizing Student Models for Causality
Complex student models often include key parameters critical to their behavior and effectiveness. For example, one meta-cognitive model of student help-seeking in intelligent tutor...
Benjamin Shih, Kenneth R. Koedinger, Richard Schei...
ACNS
2006
Springer
86views Cryptology» more  ACNS 2006»
15 years 3 months ago
Efficient Memory Bound Puzzles Using Pattern Databases
CPU bound client puzzles have been suggested as a defense mechanism against connection depletion attacks. However, the wide disparity in CPU speeds prevents such puzzles from being...
Sujata Doshi, Fabian Monrose, Aviel D. Rubin