Sciweavers

16404 search results - page 3000 / 3281
» A set coverage problem
Sort
View
141
Voted
ADBIS
2005
Springer
147views Database» more  ADBIS 2005»
15 years 10 months ago
Declarative Data Fusion - Syntax, Semantics, and Implementation
In today’s integrating information systems data fusion, i.e., the merging of multiple tuples about the same real-world object into a single tuple, is left to ETL tools and other ...
Jens Bleiholder, Felix Naumann
APN
2005
Springer
15 years 10 months ago
Genetic Process Mining
The topic of process mining has attracted the attention of both researchers and tool vendors in the Business Process Management (BPM) space. The goal of process mining is to discov...
Wil M. P. van der Aalst, Ana Karla A. de Medeiros,...
147
Voted
ESA
2005
Springer
113views Algorithms» more  ESA 2005»
15 years 10 months ago
Online View Maintenance Under a Response-Time Constraint
Abstract. A materialized view is a certain synopsis structure precomputed from one or more data sets (called base tables) in order to facilitate various queries on the data. When t...
Kamesh Munagala, Jun Yang 0001, Hai Yu
GECCO
2005
Springer
186views Optimization» more  GECCO 2005»
15 years 10 months ago
Subproblem optimization by gene correlation with singular value decomposition
Several ways of using singular value decomposition (SVD), a linear algebra technique typically used for information retrieval, to decompose problems into subproblems are investiga...
Jacob G. Martin
169
Voted
ICALP
2005
Springer
15 years 10 months ago
Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines
We establish the first polynomial-strength time-space lower bounds for problems in the lineartime hierarchy on randomized machines with two-sided error. We show that for any inte...
Scott Diehl, Dieter van Melkebeek
« Prev « First page 3000 / 3281 Last » Next »