Sciweavers

4541 search results - page 222 / 909
» Cache-Oblivious Algorithms and Data Structures
Sort
View
SODA
1998
ACM
113views Algorithms» more  SODA 1998»
15 years 4 months ago
Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs
We develop data structures for dynamic closest pair problems with arbitrary (not necessarily geometric) distance functions, based on a technique previously used by the author for ...
David Eppstein
WEA
2004
Springer
124views Algorithms» more  WEA 2004»
15 years 8 months ago
Experimental Studies of Symbolic Shortest-Path Algorithms
Abstract. Graphs can be represented symbolically by the Ordered Binary Decision Diagram (OBDD) of their characteristic function. To solve problems in such implicitly given graphs, ...
Daniel Sawitzki
ICST
2008
IEEE
15 years 9 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
AIIA
2001
Springer
15 years 8 months ago
A Knowledge-Based Neurocomputing Approach to Extract Refined Linguistic Rules from Data
– This paper proposes a knowledge-based neurocomputing approach to extract and refine a set of linguistic rules from data. A neural network is designed along with its learning al...
Giovanna Castellano, Anna Maria Fanelli
160
Voted
CGI
2000
IEEE
15 years 7 months ago
Reconstruction of B-spline Surfaces from Scattered Data Points
We present a new approach for reconstructing a smooth surface from a set of scattered points in three-dimensional (3D) space. Our algorithm first decomposes a given point set int...
Benjamin F. Gregorski, Bernd Hamann, Kenneth I. Jo...