2698 search results - page 70 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
ICEIS
2003
IEEE
14 years 3 months ago
2003
IEEE
: A major problem that arises from integrating different databases is the existence of duplicates. Data cleaning is the process for identifying two or more records within the datab...
JCP
2007
13 years 10 months ago
2007
Abstract— Data synopsis is a lossy compressed representation of data stored into databases that helps the query optimizer to speed up the query process, e.g. time to retrieve the...
DIS
2007
Springer
14 years 4 months ago
2007
Springer
The maximum cardinality of a frequent set as well as the minimum cardinality of an infrequent set are important characteristic numbers in frequent (item) set mining. Gunopulos et a...
JCO
2007
13 years 10 months ago
2007
Let G = (V, E) be a connected multigraph, whose edges are associated with labels specified by an integer-valued function L : E → N. In addition, each label ℓ ∈ N has a non-...
STACS
2001
Springer
14 years 2 months ago
2001
Springer
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...