Sciweavers

7015 search results - page 1043 / 1403
» Approximation algorithms for co-clustering
Sort
View
PPSN
1998
Springer
15 years 11 months ago
A Spatial Predator-Prey Approach to Multi-objective Optimization: A Preliminary Study
This paper presents a novel evolutionary approach of approximating the shape of the Pareto-optimal set of multi-objective optimization problems. The evolutionary algorithm (EA) use...
Marco Laumanns, Günter Rudolph, Hans-Paul Sch...
RT
1998
Springer
15 years 11 months ago
Image-Based Rendering for Non-Diffuse Synthetic Scenes
Most current image-based rendering methods operate under the assumption that all of the visible surfaces in the scene are opaque ideal diffuse (Lambertian) reflectors. This paper i...
Dani Lischinski, Ari Rappoport
ECML
1997
Springer
15 years 11 months ago
Parallel and Distributed Search for Structure in Multivariate Time Series
Abstract. E cient data mining algorithms are crucial fore ective knowledge discovery. We present the Multi-Stream Dependency Detection (msdd) data mining algorithm that performs a ...
Tim Oates, Matthew D. Schmill, Paul R. Cohen
PLILP
1993
Springer
15 years 10 months ago
Higher-Order Chaotic Iteration Sequences
Chaotic iteration sequences is a method for approximating fixpoints of monotonic functions proposed by Patrick and Radhia Cousot. It may be used in specialisation algorithms for ...
Mads Rosendahl
SIGMOD
1994
ACM
91views Database» more  SIGMOD 1994»
15 years 10 months ago
Estimating Page Fetches for Index Scans with Finite LRU Buffers
We describe an algorithm for estimating the number of page fetches for a partial or complete scan of a B-tree index. The algorithm obtains estimates for the number of page fetches ...
Arun N. Swami, K. Bernhard Schiefer
« Prev « First page 1043 / 1403 Last » Next »