16404 search results - page 3226 / 3281 » A set coverage problem |
118
Voted
JCIT
2008
15 years 16 days ago
2008
As the number of available Web services increases, there is a growing demand to find the service that best fits the user's requirements. Especially, when a set of services fu...
103
Voted
CORR
2007
Springer
15 years 16 days ago
2007
Springer
We conducted a preliminary field study to understand the current state of personal digital archiving in practice. Our aim is to design a service for the long-term storage, preserv...
107
click to vote
JCST
2008
15 years 16 days ago
2008
This paper presents some new algorithms to efficiently mine max frequent generalized itemsets (g-itemsets) and essential generalized association rules (g-rules). These are compact ...
115
Voted
CORR
2007
Springer
15 years 16 days ago
2007
Springer
— In order to optimize the costs and time of design of the new products while improving their quality, concurrent engineering is based on the digital model of these products, the...
99
Voted
CORR
2007
Springer
15 years 16 days ago
2007
Springer
The analysis of random coding error exponents pertaining to erasure/list decoding, due to Forney, is revisited. Instead of using Jensen’s inequality as well as some other inequa...