350 search results - page 69 / 70 » Lower and upper bounds on obtaining history independence |
HM
2007
Springer
15 years 5 months ago
2007
Springer
The connected facility location (ConFL) problem generalizes the facility location problem and the Steiner tree problem in graphs. Given a graph G = (V, E), a set of customers D ⊆...
100
click to vote
CIKM
2005
Springer
15 years 5 months ago
2005
Springer
Accurately and efficiently estimating the number of distinct values for some attribute(s) or sets of attributes in a data set is of critical importance to many database operation...
117
click to vote
MMDB
2004
ACM
15 years 5 months ago
2004
ACM
Multivariate time series (MTS) datasets are common in various multimedia, medical and financial applications. We propose a similarity measure for MTS datasets, Eros (Extended Fro...
120
click to vote
CORR
2010
Springer
14 years 6 months ago
2010
Springer
Matching dependencies were recently introduced as declarative rules for data cleaning and entity resolution. Enforcing a matching dependency on a database instance identifies the ...
102
click to vote
WINET
2010
14 years 10 months ago
2010
Abstract Algorithms for scheduling TDMA transmissions in multi-hop networks usually determine the smallest length conflict-free assignment of slots in which each link or node is a...