Sciweavers

4850 search results - page 86 / 970
» Approximate Data Structures with Applications
Sort
View
ICALP
1999
Springer
15 years 2 months ago
Online Data Structures in External Memory
The data sets for many of today's computer applications are too large to t within the computer's internal memory and must instead be stored on external storage devices su...
Jeffrey Scott Vitter
ICPR
2008
IEEE
15 years 4 months ago
Linear discriminant analysis for data with subcluster structure
Linear discriminant analysis (LDA) is a widely-used feature extraction method in classification. However, the original LDA has limitations due to the assumption of a unimodal str...
Haesun Park, Jaegul Choo, Barry L. Drake, Jinwoo K...
FLAIRS
2004
14 years 11 months ago
Structure Discovery from Sequential Data
In this paper we describe I-Subdue, an extension to the Subdue graph-based data mining system. I-Subdue operates over sequentially received relational data to incrementally discov...
Jeffrey Coble, Diane J. Cook, Lawrence B. Holder, ...
ICST
2008
IEEE
15 years 4 months ago
Automated Session Data Repair for Web Application Regression Testing
This paper introduces an approach to web application regression testing, based upon repair of user session data. The approach is entirely automated. It consists of a white box exa...
Mark Harman, Nadia Alshahwan
STOC
2001
ACM
139views Algorithms» more  STOC 2001»
15 years 10 months ago
Approximate distance oracles
Let G = (V, E) be an undirected weighted graph with |V | = n and |E| = m. Let k 1 be an integer. We show that G = (V, E) can be preprocessed in O(kmn1/k ) expected time, construc...
Mikkel Thorup, Uri Zwick