Sciweavers

2254 search results - page 164 / 451
» Computing the minimal covering set
Sort
View
ICWMC
2006
IEEE
16 years 19 days ago
Future Hybrid Cellular-Broadcasting Systems for Multimedia Multicasting
— This paper discusses hybrid cellular-broadcasting systems as an alternative for future delivery of wireless multimedia multicast services. A resource management framework is pr...
Aurelian Bria
COMPGEOM
2006
ACM
16 years 17 days ago
How to get close to the median shape
In this paper, we study the problem of L1-fitting a shape to a set of point, where the target is to minimize the sum of distances of the points to the shape, or alternatively the...
Sariel Har-Peled
DBA
2006
182views Database» more  DBA 2006»
15 years 8 months ago
Matrix Apriori: Speeding Up the Search for Frequent Patterns
This work discusses the problem of generating association rules from a set of transactions in a relational database, taking performance and accuracy of found results as the essent...
Judith Pavón, Sidney Viana, Santiago G&oacu...
DAM
2007
91views more  DAM 2007»
15 years 6 months ago
Integer linear programming approaches for non-unique probe selection
In addition to their prevalent use for analyzing gene expression, DNA microarrays are an efficient tool for biological, medical, and industrial applications because of their abil...
Gunnar W. Klau, Sven Rahmann, Alexander Schliep, M...
APAL
2010
85views more  APAL 2010»
15 years 6 months ago
Elementary differences between the degrees of unsolvability and degrees of compressibility
Given two infinite binary sequences A, B we say that B can compress at least as well as A if the prefix-free Kolmogorov complexity relative to B of any binary string is at most as ...
George Barmpalias