1477 search results - page 67 / 296 » Complexity of (iterated) dominance |
162
click to vote
FSTTCS
2009
Springer
16 years 22 days ago
2009
Springer
Partial Cover problems are optimization versions of fundamental and well studied problems like Vertex Cover and Dominating Set. Here one is interested in covering (or dominating) ...
202
click to vote
TCOM
2008
15 years 5 months ago
2008
Abstract--We investigate a new approach to uplink communications in wideband outdoor cellular systems that can take advantage of multiple antennas at the base station in a scalable...
143
click to vote
HICSS
2009
IEEE
16 years 1 months ago
2009
IEEE
Customers of complex IT-services increasingly demand integrated value bundles that fit their individual needs. At the same time, IT service providers are facing commoditization of...
150
click to vote
ICCS
2007
Springer
16 years 10 days ago
2007
Springer
Abstract. Hierarchical (H)-matrices approximate full or sparse matrices using a hierarchical data sparse format. The corresponding H-matrix arithmetic reduces the time complexity o...
161
click to vote
ICMLA
2008
15 years 7 months ago
2008
In order to overcome the computation and storage problem for large-scale data set, an efficient iterative method of Generalized Discriminant Analysis is proposed. Because sample v...