1272 search results - page 206 / 255 » The Set Cover with Pairs Problem |
ICDE
2006
IEEE
14 years 11 months ago
2006
IEEE
Join techniques deploying approximate match predicates are fundamental data cleaning operations. A variety of predicates have been utilized to quantify approximate match in such o...
BMCBI
2006
13 years 10 months ago
2006
Background: An important class of interaction switches for biological circuits and disease pathways are short binding motifs. However, the biological experiments to find these bin...
MP
2007
13 years 9 months ago
2007
Given a primal-dual pair of linear programs, it is well known that if their optimal values are viewed as lying on the extended real line, then the duality gap is zero, unless both...
CODES
2007
IEEE
14 years 4 months ago
2007
IEEE
We address the problem of instruction selection for Multi-Output Instructions (MOIs), producing more than one result. Such inherently parallel hardware instructions are very commo...
ICDE
2005
IEEE
14 years 3 months ago
2005
IEEE
Abstract— Defining suitable indexes is a major task when optimizing a database. Usually, a human database administrator defines a set of indexes in the design phase of the data...