1017 search results - page 68 / 204 » Some existence and construction results of polygonal designs |
100
click to vote
DIALM
2000
ACM
15 years 4 months ago
2000
ACM
The allocation of scarce spectral resources to support as many user applications as possible while maintaining reasonable quality of service is a fundamental problem in wireless c...
SIGSOFT
2000
ACM
15 years 4 months ago
2000
ACM
Academic research sometimes suffers from the “ivory tower” problem: some ideas that sound good in theory do not necessarily work well in practice. An example of research that ...
111
click to vote
SODA
2012
ACM
13 years 2 months ago
2012
ACM
Given a class of graphs F, we say that a graph G is universal for F, or F-universal, if every H ∈ F is contained in G as a subgraph. The construction of sparse universal graphs ...
145
click to vote
WADS
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. A Semi-Separated Pair Decomposition (SSPD), with parameter s > 1, of a set S ⊂ Rd is a set {(Ai, Bi)} of pairs of subsets of S such that for each i, there are balls ...
BMCBI
2007
14 years 12 months ago
2007
Background: Data clustering analysis has been extensively applied to extract information from gene expression profiles obtained with DNA microarrays. To this aim, existing cluster...